3,660 research outputs found

    A construction of one-dimensional affine flag-transitive linear spaces

    Get PDF
    AbstractThe finite flag-transitive linear spaces which have an insoluble automorphism group were given a precise description in [Francis Buekenhout, Anne Delandtsheer, Jean Doyen, Peter B. Kleidman, Martin W. Liebeck, Jan Saxl, Linear spaces with flag-transitive automorphism groups, Geom. Dedicata 36 (1) (1990) 89–94], and their classification has recently been completed (see [Martin W. Liebeck, The classification of finite linear spaces with flag-transitive automorphism groups of affine type, J. Combin. Theory Ser. A 84 (2) (1998) 196–235] and [Jan Saxl, On finite linear spaces with almost simple flag-transitive automorphism groups, J. Combin. Theory Ser. A 100 (2) (2002) 322–348]). However, the remaining case where the automorphism group is a subgroup of one-dimensional affine transformations has not been classified and bears a variety of known examples. Here we give a construction of new one-dimensional affine flag-transitive linear spaces via the André/Bruck–Bose construction applied to transitive line-spreads of projective space

    A Census Of Highly Symmetric Combinatorial Designs

    Full text link
    As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently strong symmetry properties. However, despite the finite simple group classification, for Steiner t-designs with t > 2 most of these characterizations have remained longstanding challenging problems. Especially, the determination of all flag-transitive Steiner t-designs with 2 < t < 7 is of particular interest and has been open for about 40 years (cf. [11, p. 147] and [12, p. 273], but presumably dating back to 1965). The present paper continues the author's work [20, 21, 22] of classifying all flag-transitive Steiner 3-designs and 4-designs. We give a complete classification of all flag-transitive Steiner 5-designs and prove furthermore that there are no non-trivial flag-transitive Steiner 6-designs. Both results rely on the classification of the finite 3-homogeneous permutation groups. Moreover, we survey some of the most general results on highly symmetric Steiner t-designs.Comment: 26 pages; to appear in: "Journal of Algebraic Combinatorics

    Steiner t-designs for large t

    Full text link
    One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L. Teirlinck has shown that non-trivial t-designs exist for all values of t, no non-trivial Steiner t-design with t > 5 has been constructed until now. Understandingly, the case t = 6 has received considerable attention. There has been recent progress concerning the existence of highly symmetric Steiner 6-designs: It is shown in [M. Huber, J. Algebr. Comb. 26 (2007), pp. 453-476] that no non-trivial flag-transitive Steiner 6-design can exist. In this paper, we announce that essentially also no block-transitive Steiner 6-design can exist.Comment: 9 pages; to appear in: Mathematical Methods in Computer Science 2008, ed. by J.Calmet, W.Geiselmann, J.Mueller-Quade, Springer Lecture Notes in Computer Scienc

    The Classification of Flag-transitive Steiner 4-Designs

    Full text link
    Among the properties of homogeneity of incidence structures flag-transitivity obviously is a particularly important and natural one. Consequently, in the last decades also flag-transitive Steiner tdesigns (i.e. flag-transitive t-(v,k,1) designs) have been investigated, whereas only by the use of the classification of the finite simple groups has it been possible in recent years to essentially characterize all flag-transitive Steiner 2-designs. However, despite the finite simple group classification, for Steiner t-designs with parameters t > 2 such characterizations have remained challenging open problems for about 40 years (cf. [11, p. 147] and [12, p. 273], but presumably dating back to around 1965). The object of the present paper is to give a complete classification of all flag-transitive Steiner 4-designs. Our result relies on the classification of the finite doubly transitive permutation groups and is a continuation of the author's work [20, 21] on the classification of all flag-transitive Steiner 3-designs.Comment: 26 pages; to appear in: "Journal of Algebraic Combinatorics

    Block-Transitive Designs in Affine Spaces

    Full text link
    This paper deals with block-transitive tt-(v,k,λ)(v,k,\lambda) designs in affine spaces for large tt, with a focus on the important index λ=1\lambda=1 case. We prove that there are no non-trivial 5-(v,k,1)(v,k,1) designs admitting a block-transitive group of automorphisms that is of affine type. Moreover, we show that the corresponding non-existence result holds for 4-(v,k,1)(v,k,1) designs, except possibly when the group is one-dimensional affine. Our approach involves a consideration of the finite 2-homogeneous affine permutation groups.Comment: 10 pages; to appear in: "Designs, Codes and Cryptography

    On the existence of block-transitive combinatorial designs

    Full text link
    Block-transitive Steiner tt-designs form a central part of the study of highly symmetric combinatorial configurations at the interface of several disciplines, including group theory, geometry, combinatorics, coding and information theory, and cryptography. The main result of the paper settles an important open question: There exist no non-trivial examples with t=7t=7 (or larger). The proof is based on the classification of the finite 3-homogeneous permutation groups, itself relying on the finite simple group classification.Comment: 9 pages; to appear in "Discrete Mathematics and Theoretical Computer Science (DMTCS)

    Large dimensional classical groups and linear spaces

    Get PDF
    Suppose that a group GG has socle LL a simple large-rank classical group. Suppose furthermore that GG acts transitively on the set of lines of a linear space S\mathcal{S}. We prove that, provided LL has dimension at least 25, then GG acts transitively on the set of flags of S\mathcal{S} and hence the action is known. For particular families of classical groups our results hold for dimension smaller than 25. The group theoretic methods used to prove the result (described in Section 3) are robust and general and are likely to have wider application in the study of almost simple groups acting on finite linear spaces.Comment: 32 pages. Version 2 has a new format that includes less repetition. It also proves a slightly stronger result; with the addition of our "Concluding Remarks" section the result holds for dimension at least 2

    Linear spaces with significant characteristic prime

    Full text link
    Let GG be a group with socle a simple group of Lie type defined over the finite field with qq elements where qq is a power of the prime pp. Suppose that GG acts transitively upon the lines of a linear space S\mathcal{S}. We show that if pp is {\it significant} then GG acts flag-transitively on S\mathcal{S} and all examples are known.Comment: 11 page

    The classification of flag-transitive Steiner 3-designs

    Full text link
    We solve the long-standing open problem of classifying all 3-(v,k,1) designs with a flag-transitive group of automorphisms (cf. A. Delandtsheer, Geom. Dedicata 41 (1992), p. 147; and in: "Handbook of Incidence Geometry", ed. by F. Buekenhout, Elsevier Science, Amsterdam, 1995, p. 273; but presumably dating back to 1965). Our result relies on the classification of the finite 2-transitive permutation groups.Comment: 27 pages; to appear in the journal "Advances in Geometry
    • …
    corecore