Multiplicity-layer decomposition of complete multiset designs
Ars Combinatoria · 29.03.2026 · 166 · 47-54
DOI: 10.61091/ars166-04 ↗Kurz gefasst
Fachartikel in der Zeitschrift Ars Combinatoria, online erschienen am 29.03.2026. Verfasst von Apurv Srivastav und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The design whose blocks consist of all \(k\)-element multisets drawn from a \(v\)-set, denoted \(M(v,k)\), is a classical example of a balanced \((k+1)\)-ary design. Although its parameters are well known, existing derivations often rely on general multiset design theory. This paper gives unified elementary derivations of the parameters \(b\), \(r\), and \(\lambda\) using stars-and-bars and double counting. We exhibit a natural multiplicity-layer decomposition: removing \(s\) copies of a fixed point from all blocks in which it has multiplicity exactly \(s\) yields a family of subdesigns naturally in bijection with \(M(v-1,k-s)\). This viewpoint clarifies the recursive structure underlying complete multiset designs. Finally, the multiplicity vectors of blocks of \(M(v,k)\) form a \((k+1)\)-ary code of length \(v\) with constant coordinate sum \(k\) and minimum Hamming distance \(2\), achieving size \(\binom{v+k-1}{k}\).
Zitieren
APA
Srivastav, A., & Srivastav, S. K. (2026). Multiplicity-layer decomposition of complete multiset designs. Ars Combinatoria, 166, 47-54. https://doi.org/10.61091/ars166-04
Vancouver
Srivastav A, Srivastav SK. Multiplicity-layer decomposition of complete multiset designs. Ars Combinatoria. 2026;166:47-54. doi:10.61091/ars166-04
BibTeX
@article{Srivastav2026,
author = {Srivastav, Apurv and Srivastav, Sudesh K.},
title = {Multiplicity-layer decomposition of complete multiset designs},
journal = {Ars Combinatoria},
year = {2026},
volume = {166},
pages = {47--54},
doi = {10.61091/ars166-04}
}
EUVIMED