Multiplicity-layer decomposition of complete multiset designs

Read full text Summarise with VIRAT
Authors: Apurv Srivastav, Sudesh Srivastav
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

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}\).

Fields of Study & Subjects

Advanced Combinatorial Mathematics Coding theory and cryptography Finite Group Theory Research

Publication details

Journal / source
Ars Combinatoria
Volume
166
Pages
47–54
Publication date
28 March 2026
Language
EN