{
  "abstract": "Let $C_n$ be a cyclic group of order $n\\ge 2$, and let $S=g_1\\cdot\\ldots\\cdot g_{\\ell}$ be a sequence over $C_n$, with repetitions allowed. We denote by $\\mathsf N_0^n(S)$ the number of subsets $I\\subseteq[1,\\ell]$ with $|I|=n$ and $\\sum_{i\\in I}g_i=0$. A conjecture proposed by Bialostocki and Lotspeich in 1992 states that $$\\mathsf N_0^n(S)\\ge \\binom{\\lfloor |S|/2\\rfloor}{n}+ \\binom{\\lceil |S|/2\\rceil}{n}.$$ Several partial results toward this conjecture are known. In this paper, we prove this conjecture completely.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.37125",
  "author_total": 2,
  "authors": [
    {
      "name": "Guoqing Wang"
    },
    {
      "name": "Xiangneng Zeng"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/f1fv541nen7ec.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.37125",
  "fulltext_url": null,
  "id": "f1fv541nen7ec",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.37125",
  "language": null,
  "licence": "CC-BY-4.0",
  "licence_label": "CC BY 4.0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/licenses/by/4.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.NT"
    ],
    [
      "openalex",
      "2607|Advanced Combinatorial Mathematics"
    ]
  ],
  "openalex": "W7224080952",
  "pdf_url": "https://arxiv.org/pdf/2610.37125",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-27",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/f1fv541nen7ec.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:35:53Z",
      "native_id": "2610.37125",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.37125"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.NT",
      "subfield": "algebra-number-theory"
    },
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Enumeration of zero-sum subsequences: A proof of Bialostocki-Lotspeich conjecture",
  "title_text": "Enumeration of zero-sum subsequences: A proof of Bialostocki-Lotspeich conjecture",
  "type": "preprint",
  "updated_at": "2026-10-30T12:35:53Z",
  "url": "https://research.draconitic.com/paper/f1fv541nen7ec",
  "venue": "arXiv",
  "versions": []
}