Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A stabilizer lemma for translation generalized quadrangles
Thas K. European Journal of Combinatorics28 (1):1-16,2007.Type:Article
Date Reviewed: Jun 4 2007

Generalized quadrangles are incidence structures introduced by J. Tits in his celebrated paper [1], as a means to study finite simple groups. Finite generalized quadrangles (GQs) embedded in a finite projective space are called finite classical generalized quadrangles, and can be studied using tools from classical finite projective geometry. But GQs are also studied very intensively in a synthetic way [2], where geometrical, combinatorial, and group theoretical arguments are combined to obtain results. The study of GQs is a very active field of research in finite incidence geometry. Furthermore, GQs are used nowadays to construct codes.

Obtaining characterizations of GQs imposing group theoretic conditions is almost a field of research by itself. First of all, in this paper, the author considers only translation GQs, that is, GQs satisfying many symmetry conditions that are expressed using group theoretical conditions. The author considers a translation GQ S of order (s,s2), s > 1, s odd with a good line L. There are precisely s3+s2 subquadrangles of order s containing L, and one can consider the action of the symmetry group of S on these subquadrangles.

The author proves, as a corollary of a slightly stronger lemma, that, provided this action is transitive, the original GQ S is a classical GQ Q(5,s), that is, the GQ arising by considering the points and lines of an elliptic quadric in the finite projective space PG(5,s). This is a nice result that contributes to the general synthetic study of group theoretic characterizations of GQs.

Reviewer:  Jan De Beule Review #: CR134350 (0805-0493)
1) Tits, J. Sur la trialiti et certains groupes qui s'en diduisent. Inst. Hautes Etudes Sci. Publ. Math. 2, (1959), 13–60.
2) Payne, S.E.; Thas, J.A. Finite generalized quadranglesVolume 110 of Research Notes in Mathematics: Volume 110 of Research Notes in Mathematics. Pitman, Boston, MA, 1984.
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Complexity Of Proof Procedures (F.2.2 ... )
 
 
Combinatorial Algorithms (G.2.1 ... )
 
 
Computations In Finite Fields (F.2.1 ... )
 
 
Combinatorics (G.2.1 )
 
 
Numerical Algorithms And Problems (F.2.1 )
 
Would you recommend this review?
yes
no
Other reviews under "Complexity Of Proof Procedures": Date
Exponential lower bounds for the pigeonhole principle
Beame P., Impagliazzo R., Krajíček J., Pitassi T., Pudlák P., Woods A.  Theory of computing (, Victoria, British Columbia, Canada, May 4-6, 1992)2201992. Type: Proceedings
May 1 1993
The complexity of propositional linear temporal logics
Sistla A., Clarke E. Journal of the ACM 32(3): 733-749, 1985. Type: Article
Aug 1 1986
Many hard examples for resolution
Chvátal V., Szemerédi E. Journal of the ACM 35(4): 759-768, 1988. Type: Article
Jul 1 1989
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy