Designs, permutations, and transitive groups

05/17/2021
by   Minjia Shi, et al.
0

A notion of t-designs in the symmetric group on n letters was introduced by Godsil in 1988. In particular t-transitive sets of permutations form a t-design. We derive special lower bounds for t=1 and t=2 by a power moment method. For general n,t we give a For n≥ 4 and t=2, this bound is strong enough to show a lower bound on the size of such t-designs of n(n-1)… (n-t+1), which is best possible when sharply t-transitive sets of permutations exist. This shows, in particular, that tight 2-designs do not exist.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2021

The covering radius of permutation designs

A notion of t-designs in the symmetric group on n letters was introduced...
research
03/15/2023

Combinatorial Designs Meet Hypercliques: Higher Lower Bounds for Klee's Measure Problem and Related Problems in Dimensions d≥ 4

Klee's measure problem (computing the volume of the union of n axis-para...
research
01/15/2021

Random and quasi-random designs in group testing

For large classes of group testing problems, we derive lower bounds for ...
research
02/27/2018

On optimal designs for non-regular models

Classically, Fisher information is the relevant object in defining optim...
research
01/28/2021

A note on tight projective 2-designs

We study tight projective 2-designs in three different settings. In the ...
research
10/04/2022

The DAG Visit approach for Pebbling and I/O Lower Bounds

We introduce the notion of an r-visit of a Directed Acyclic Graph DAG G=...
research
04/30/2023

Representing the Special Linear Group with Block Unitriangular Matrices

We prove that every element of the special linear group can be represent...

Please sign up or login with your details

Forgot password? Click here to reset