Davenport Constants of High-Dimensional Integer Sets

arXiv:2611.14140 · math.CO, math.NT, math.OC · Submitted 2026-11-10 · Read on arXiv

math.CO, math.NT, math.OC

Submitted: 2026-11-10

Updated: 2026-11-10

License: http://creativecommons.org/licenses/by/4.0/

The gist: The Davenport constant of a finite set of integer vectors is the maximum length of an irreducible zero-sum sequence over that set.

Abstract

The Davenport constant of a finite set of integer vectors is the maximum length of an irreducible zero-sum sequence over that set. For nonempty sets closed under negation, it equals the largest 1-norm of a Graver basis element of the matrix formed by those vectors. We study extremal and average-case versions in growing dimension, with applications to integer programming. For integer cubes [-R,R] d Z d and the sign cube-1,1 d, totally unimodular encodings improve on the upper bounds from direct circuit decomposition, while random perturbations of Hadamard matrices give new lower bounds. A key ingredient is a uniform affine Bernoulli variant of Nguyen and Wood's surjectivity theorem. In every sufficiently large dimension the sign-cube lower bound is d d/22-d-o(d), and the integer-cube lower bound is R d d d/22-o(d) uniformly for polynomially bounded integer radii. For random sign-cube sequences of even length conditioned on summing to zero, we prove a sharp threshold from irreducibility to reducibility at d d/ 4, far below the extremal scale. For fixed p and R, we determine exact exponential rates for lattice p-balls when p=1, R at least3, or 2 at most p< infinity, R p at least3. For each fixed integer k at least3, we determine the exponential rate of the worst-case 1-distance from an optimal LP vertex to the nearest integer optimum in standard-form programs with ternary matrices having at most k nonzero entries per column.

Sources

Related papers