Metraipolis › archive › dc_9b97fc0bcc7b

An Eventown Result for Multisets — arXiv:2610.21636

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.21636
License (as archived)
CC0-1.0
Archived
2026-10-16T10:33:45.189Z
SHA-256 of the archived text
3cd1b4d5bf664b5fa0fefb131b6ea342c00bd8707d98fa42d967ef5f81877f3b
Stable URL of this page
https://metraipolis.com/documento/dc_9b97fc0bcc7b

How to cite

An Eventown Result for Multisets — arXiv:2610.21636 — arXiv (en), https://arxiv.org/abs/2610.21636 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b97fc0bcc7b (Metraipolis archive dc_9b97fc0bcc7b, sha256 3cd1b4d5bf664b5fa0fefb131b6ea342c00bd8707d98fa42d967ef5f81877f3b)
BibTeX
@misc{dc9b97fc0bcc7b,
  title = {An Eventown Result for Multisets — arXiv:2610.21636},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.21636},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b97fc0bcc7b; sha256 3cd1b4d5bf664b5fa0fefb131b6ea342c00bd8707d98fa42d967ef5f81877f3b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.21636. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study an extension of the Eventown problem of sets to multisets on $[n] = \{1,2,...,n\}$. A multiset is called $m$-bounded if each element has multiplicity at most $m$. The intersection of two multisets is defined as the multiset in which each element has multiplicity equal to the minimum of its multiplicities in the two original multisets. A family of $m$-bounded multisets is called an Eventown family if every member and the intersection of every pair of distinct members has even cardinality, with cardinalities counted with multiplicities. We determine the maximum size $E_m(n)$ of such a family for every $m$ and $n$. We show that $ E_{2q}(n)=(q+1)^n, $ and $ E_{2q+1}(n)=(q+1)^{n-2k}\bigl((q+1)^2+1\bigr)^k,$ where $k=\lfloor n/2\rfloor$. In particular, the case $m=1$ recovers the classical Eventown theorem for sets. We also characterize all extremal families for $m\ge2$. For even $m$, the unique extremal family consists of all multisets in which every element has even multiplicity. For odd $m\ge3$, every extremal family has a product structure arising from two explicit families on pairs of coordinates, together with an additional coordinate restricted to even multiplicities when $n$ is odd. Consequently, there are exactly $k+1$ extremal types up to permutations of the ground set.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.21636 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T08:50:47.591Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).