Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 11 min ago
PreprintCC BY 4.0arXiv

An Eventown Result for Multisets

Abstract

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 Em(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=⌊ n/2⌋. In particular, the case m=1 recovers the classical Eventown theorem for sets. We also characterize all extremal families for m≥2. For even m, the unique extremal family consists of all multisets in which every element has even multiplicity. For odd m≥3, 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.

Related

  1. An oscillation result for slightly perturbed trigonometric series
    Alain Haraux
    HALPreprintLicence Ouverte 2.0Full textAnalysis & PDEsHALarXiv
  2. A Liouville type rigidity result for entire solutions of the k-Hessian equation
    Bin Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. A finiteness result for split exceptional dual pairs
    Hung Yean Loke, Gordan Savin
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  4. A Note on a Result of Chen Li: the Thinning Problem via the Kernel Method
    Xuan Fang, Tianyu Wang
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsProbabilityarXiv
  5. An Erdős-Szekeres-Type Result on Permutation Patterns
    Nicholas Van Nimwegen
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{banerjee2026eventown,
  title = {{An Eventown Result for Multisets}},
  author = {Anirban Banerjee and Abisek Dewan},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21636},
  eprint = {2610.21636},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21636},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - An Eventown Result for Multisets
AU  - Anirban Banerjee
AU  - Abisek Dewan
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.21636
UR  - https://arxiv.org/abs/2610.21636
AB  - 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=⌊ n/2⌋. In particular, the case m=1 recovers the classical Eventown theorem for sets. We also characterize all extremal families for m≥2. For even m, the unique extremal family consists of all multisets in which every element has even multiplicity. For odd m≥3, 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.
ER  -