Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
We consider 2-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on 2-designs which are block-transitive but not necessarily flag-transitive. In particular we use the concept of the “array” of a point subset with respect to the chain of point-partitions; the array describes the distribution of the points in the subset among the classes of each partition. We obtain necessary and sufficient conditions on the array in order for the subset to be a block of such a design. By explicit construction we show that for any $$s \ge 2$$ s ≥ 2 , there are infinitely many 2-designs admitting a flag-transitive group that preserves an invariant chain of point-partitions of length s. Moreover an exhaustive computer search, using Magma, seeking designs with $$e_1e_2e_3$$ e 1 e 2 e 3 points (where each $$e_i\le 50$$ e i ≤ 50 ) and a partition chain of length $$s=3$$ s = 3 , produced 57 such flag-transitive designs, among which only three designs arise from our construction—so there is still much to learn.
We consider 2-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We build on our recent work on 2-designs which are block-transitive but not necessarily flag-transitive. In particular we use the concept of the “array” of a point subset with respect to the chain of point-partitions; the array describes the distribution of the points in the subset among the classes of each partition. We obtain necessary and sufficient conditions on the array in order for the subset to be a block of such a design. By explicit construction we show that for any $$s \ge 2$$ s ≥ 2 , there are infinitely many 2-designs admitting a flag-transitive group that preserves an invariant chain of point-partitions of length s. Moreover an exhaustive computer search, using Magma, seeking designs with $$e_1e_2e_3$$ e 1 e 2 e 3 points (where each $$e_i\le 50$$ e i ≤ 50 ) and a partition chain of length $$s=3$$ s = 3 , produced 57 such flag-transitive designs, among which only three designs arise from our construction—so there is still much to learn.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.