Enumeration of zero-sum subsequences: A proof of Bialostocki-Lotspeich conjecture
math.CO, math.NT
Submitted: 2026-10-27
Updated: 2026-10-27
License: http://creativecommons.org/licenses/by/4.0/
The gist: Let C n be a cyclic group of order n at least 2, and let S=g 1 times times g be a sequence over C n, with repetitions allowed.
Abstract
Let C n be a cyclic group of order n at least 2, and let S=g 1 times times g be a sequence over C n, with repetitions allowed. We denote by N 0 n(S) the number of subsets I [1,] with I=n and sum i in Ig i=0. A conjecture proposed by Bialostocki and Lotspeich in 1992 states that N 0 n(S) at least n + n. Several partial results toward this conjecture are known. In this paper, we prove this conjecture completely.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality