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

Institutions

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

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Block-transitive designs with a poset of imprimitive partitions

Alice Devillers, Cheryl E. Praeger, Carmen Amarra
Designs Codes and Cryptography
graph theory and CDMA systems
article

Block-transitive designs with a poset of imprimitive partitions

Alice Devillers, Cheryl E. Praeger, Carmen Amarra
article en

Abstract

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.

Designs Codes and CryptographyVol. 94(8)
The University of Western Australia (AU), University of the Philippines Diliman (PH)
Australian Research Council
Openalex Percentile: Top 99%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Block-transitive designs with a poset of imprimitive partitions — Alice Devillers, Cheryl E. Praeger, et al. · Designs Codes and Cryptography (2026) | TGRS Research Map | TGRS