q-Analogs for Steiner Systems and Covering Designs
classification
🧮 math.CO
keywords
analogsdesignssteinercoveringsystemsexistenceprovedunknown
read the original abstract
The $q$-analogs of basic designs are discussed. It is proved that the existence of any unknown Steiner structures, the $q$-analogs of Steiner systems, implies the existence of unknown Steiner systems. Optimal $q$-analogs covering designs are presented. Some lower and upper bounds on the sizes of $q$-analogs covering designs are proved.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.