English

Completely Transitive Designs

Combinatorics 2014-05-12 v1

Abstract

We view a design D\mathcal{D} as a set of kk-subsets of a fixed set XX of vv points. A kk-subset of XX is at distance ii from D\mathcal{D} if it intersects some kk-set in D\mathcal{D} in kik-i points, and no subset in more than kik-i points. Thus D\mathcal{D} determines a partition by distance of the kk-subsets of XX. We say D\mathcal{D} is completely transitive if the cells of this partition are the orbits of the automorphism group of D\mathcal{D} in its induced action on the kk-subsets of XX. This paper initiates a study of completely transitive designs D\mathcal{D}. A classification is given of all examples for which the automorphism group is not primitive on XX. In the primitive case the focus is on examples with the property that any two distinct kk-subsets in D\mathcal{D} have at most k3k-3 points in common. Here a reduction is given to the case where the automorphism group is 22-transitive on XX. New constructions are given by classifying all examples for some families of 22-transitive groups, leaving several unresolved cases.

Keywords

Cite

@article{arxiv.1405.2176,
  title  = {Completely Transitive Designs},
  author = {Chris D. Godsil and Cheryl E. Praeger},
  journal= {arXiv preprint arXiv:1405.2176},
  year   = {2014}
}

Comments

This manuscript dates from 1997 and is unpublished. It is submitted to the arXiv in order to be accessible to researchers. (Several have asked for it, as it is referred to in various places.) It contains 18 pages

R2 v1 2026-06-22T04:09:56.684Z