MARC Record from harvard_bibliographic_metadata

LEADER: 03069cam a2200349 a 4500
001 012058052-7
005 20140910154308.0
008 081219s2009 sz a b 001 0 eng
015 $aGBA910818$2bnb
016 7 $a014895093$2Uk
020 $a9783034600019 (pbk.)
020 $a3034600011 (pbk.)
035 0 $aocn297148425
040 $aUKM$cUKM$dBTCTA$dYDXCP$dBWX
042 $aukblcatcopy
050 4 $aQA166.3$b.H8 2009
082 04 $a511.6$222
100 1 $aHuber, Michael.
245 10 $aFlag-transitive steiner designs /$cMichael Huber.
260 $aBasel ;$aBoston :$bBirkhäuser,$cc2009.
300 $aix, 124 p. :$bill. ;$c24 cm.
490 1 $aFrontiers in mathematics
504 $aIncludes bibliographical references (p. [115]-122) and index.
505 0 $aIncidence Structures and Steiner Designs -- Permutation Groups and Group Actions -- Number Theoretical Tools -- Highly Symmetric Steiner Designs -- A Census of Highly Symmetric Steiner Designs -- The Classification of Flag-transitive Steiner Quadruple Systems -- The Classification of Flag-transitive Steiner 3-Designs -- The Classification of Flag-transitive Steiner 4-Designs -- The Classification of Flag-transitive Steiner 5-Designs -- The Non-Existence of Flag-transitive Steiner 6-Designs.
520 $aThe characterization of combinatorial or geometric structures in terms of their groups of automorphisms has attracted considerable interest in the last decades and is now commonly viewed as a natural generalization of Felix Klein’s Erlangen program(1872).Inaddition,especiallyfor?nitestructures,importantapplications to practical topics such as design theory, coding theory and cryptography have made the ?eld even more attractive. The subject matter of this research monograph is the study and class- cation of ?ag-transitive Steiner designs, that is, combinatorial t-(v,k,1) designs which admit a group of automorphisms acting transitively on incident point-block pairs. As a consequence of the classi?cation of the ?nite simple groups, it has been possible in recent years to characterize Steiner t-designs, mainly for t=2,adm- ting groups of automorphisms with su?ciently strong symmetry properties. For Steiner 2-designs, arguably the most general results have been the classi?cation of all point 2-transitive Steiner 2-designs in 1985 by W. M. Kantor, and the almost complete determination of all ?ag-transitive Steiner 2-designs announced in 1990 byF.Buekenhout,A.Delandtsheer,J.Doyen,P.B.Kleidman,M.W.Liebeck, and J. Saxl. However, despite the classi?cation of the ?nite simple groups, for Steiner t-designs witht> 2 most of the characterizations of these types have remained long-standing challenging problems. Speci?cally, the determination of all ?- transitive Steiner t-designs with 3? t? 6 has been of particular interest and object of research for more than 40 years.
650 0 $aSteiner systems.
650 0 $aCombinatorics.
650 0 $aDiscrete groups.
650 0 $aMathematics.
830 0 $aFrontiers in mathematics.
988 $a20090817
906 $0OCLC