Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Biplanes with flag-transitive automorphism groups of almost simple type, with alternating or sporadic socle
Regueiro E. European Journal of Combinatorics26 (5):577-584,2005.Type:Article
Date Reviewed: Aug 23 2005

A biplane is a (v, k, 2) design, that is, a structure of v points and v blocks such that every point belongs to exactly k blocks, and every pair of blocks is incident with exactly two points. The only values of k for which examples of biplanes are known are k=3, 4, 5, 6, 9, 11, and 13.

To find other examples of biplanes, many techniques can be used, such as construction methods and computer searches. An alternative method is to assume that there is a particular group of permutations leaving the biplane invariant, and to classify the biplanes as invariant under this particular group of permutations. Either the classification shows that the known examples invariant under this group are effectively the only examples invariant under this group, or new examples arise during the classification, which is what one hopes for.

This work continues similar work in this field. In another paper by the same author [1], the biplanes admitting an imprimitive flag-transitive group are classified, and it is proved that if a biplane admits a primitive flag-transitive group, then the group is of affine or almost simple type in the O’Nan-Scott classification. The affine case was analyzed by the author [1]. Now, she shows that there are no biplanes admitting a primitive flag-transitive automorphism group of almost simple type, with alternating or sporadic socle.

Reviewer:  Leo Storme Review #: CR131703 (0603-0305)
1) O'Reilly Reguerio, E. On primitivity and reduction for flag-transitive symmetric designs. J. Combin. Theory Ser. A 109, (2005), 135–148.
Bookmark and Share
 
Permutations And Combinations (G.2.1 ... )
 
 
Combinatorial Algorithms (G.2.1 ... )
 
 
Geometrical Problems And Computations (F.2.2 ... )
 
 
Combinatorics (G.2.1 )
 
 
Nonnumerical Algorithms And Problems (F.2.2 )
 
Would you recommend this review?
yes
no
Other reviews under "Permutations And Combinations": Date
Computing short generator sequences
Driscoll J., Furst M. Information and Computation 72(2): 117-132, 1987. Type: Article
Jan 1 1988
Permutations of bounded degree generate groups of polynomial diameter
McKenzie P. (ed) Information Processing Letters 19(5): 253-254, 1984. Type: Article
Aug 1 1985
How to construct pseudorandom permutations from pseudorandom functions
Luby M. (ed), Rackoff C. SIAM Journal on Computing 17(2): 373-386, 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