Block-transitive designs with a poset of imprimitive partitions
Abstract We study block designs which admit an automorphism group that is transitive on blocks and points, and leaves invariant every partition in a given finite poset of partitions of the point set. The full stabiliser G of all the partitions in the poset is a generalised wreath product. We use the theory of generalised wreath products to give necessary and sufficient conditions, in terms of the ‘array’ of a point-subset B , for the set of G -images of B to form the block-set of a G -block-transitive 2-design. This generalises previous results for the special cases where the poset is a chain or an anti-chain. We also give explicit infinite families of examples of 2-designs for each poset involving three proper partitions, and for the famous N -poset with four partitions. (Posets with two proper partitions have been treated previously.) This suggests the problem of finding explicit examples for other posets.
Authors
- Alice Devillers (ORCID: https://orcid.org/0000-0002-0766-4032)
- Cheryl E. Praeger (ORCID: https://orcid.org/0000-0002-0881-7336)
- Carmen Amarra (ORCID: https://orcid.org/0000-0002-4494-4359)
Institutions
- The University of Western Australia (AU)
- University of the Philippines Diliman (PH)
Publication Details
- Journal
- Designs Codes and Cryptography
- Published
- 2026-07-22
- DOI
- https://doi.org/10.1007/s10623-026-01891-1
- Primary Topic
- graph theory and CDMA systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Australian Research Council