Papers
Topics
Authors
Recent
Search
2000 character limit reached

Completely Transitive Designs

Published 9 May 2014 in math.CO | (1405.2176v1)

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 k−ik-i points, and no subset in more than k−ik-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 k−3k-3 points in common. Here a reduction is given to the case where the automorphism group is $2$-transitive on XX. New constructions are given by classifying all examples for some families of $2$-transitive groups, leaving several unresolved cases.

Citations (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.