Abstract
Combining some difference methods with the famous Bays-Lambossy theorem and its generalizations we establish some non-trivial lower bounds on the number of cyclic 2-(v, k, 1) designs up to isomorphism.
| Original language | English |
|---|---|
| Article number | #P1.01 |
| Journal | Art of Discrete and Applied Mathematics |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Jan 2025 |
Keywords
- Cyclic Steiner 2-design
- difference family
- multiplier
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics
Fingerprint
Dive into the research topics of 'Some bounds on the number of cyclic Steiner 2-designs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver