Some bounds on the number of cyclic Steiner 2-designs

Marco Buratti; Mikhail E. Muzychuk

doi:10.26493/2590-9770.1790.18e

Some bounds on the number of cyclic Steiner 2-designs

Marco Buratti, Mikhail E. Muzychuk

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

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	https://doi.org/10.26493/2590-9770.1790.18e
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

Access to Document

10.26493/2590-9770.1790.18e

Cite this

@article{3d5328e611b442ae891f37cb60c714cc,

title = "Some bounds on the number of cyclic Steiner 2-designs",

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.",

keywords = "Cyclic Steiner 2-design, difference family, multiplier",

author = "Marco Buratti and Muzychuk, {Mikhail E.}",

year = "2025",

month = jan,

day = "1",

doi = "10.26493/2590-9770.1790.18e",

language = "English",

volume = "8",

journal = "Art of Discrete and Applied Mathematics",

issn = "2590-9770",

publisher = "University of Primorska",

number = "1",

}

TY - JOUR

T1 - Some bounds on the number of cyclic Steiner 2-designs

AU - Buratti, Marco

AU - Muzychuk, Mikhail E.

PY - 2025/1/1

Y1 - 2025/1/1

N2 - 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.

AB - 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.

KW - Cyclic Steiner 2-design

KW - difference family

KW - multiplier

UR - http://www.scopus.com/inward/record.url?scp=85219012226&partnerID=8YFLogxK

U2 - 10.26493/2590-9770.1790.18e

DO - 10.26493/2590-9770.1790.18e

M3 - Article

AN - SCOPUS:85219012226

SN - 2590-9770

VL - 8

JO - Art of Discrete and Applied Mathematics

JF - Art of Discrete and Applied Mathematics

IS - 1

M1 - #P1.01

ER -

Some bounds on the number of cyclic Steiner 2-designs

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this