Problem
Research questions and friction points this paper is trying to address.
Totally Unimodular Polytopes
Approximate Counting
Log-concavity
Lattice Points
Ehrhart Polynomials
Log-concavity and Approximate Counting for Totally Unimodular Polytopes
🤖 AI Summary
This project addresses the lattice point counting problem for totally unimodular polyhedra by proposing novel lower bound estimates and deterministic approximate counting algorithms. Methodologically, building upon Gurvits’s capacity-based convex optimization framework and integrating combinatorial optimization, log-concavity analysis, and Ehrhart theory, we introduce a new class of log-concave polynomials termed VLC polynomials. The principal contributions include establishing a new lower bound on the number of lattice points with an explicit exponential factor, resolving Barvinok’s log-concavity conjecture concerning contingency tables, and proving the Ferroni–Higashitani conjecture. By bridging continuous optimization techniques with discrete geometric enumeration, this work provides a new paradigm for the exact counting of high-dimensional discrete structures.
📝 Abstract
We present a new lower bound on the number of lattice points of all totally unimodular polytopes, generalizing previous lower bounds on contingency tables, integer flows, and beyond. Our bound is based on the Gurvits capacity convex optimization problem, and thus our result implies an efficient deterministic algorithm for approximate counting of the lattice points up to an explicit exponential factor. We achieve our bounds by showing that the associated generating polynomials fit into a new general class of log-concave polynomials called VLC ("variable-wise log-concavity''). This also implies a conjecture of Ferroni and Higashitani on the evaluations of the Ehrhart polynomials of unimodular polytopes. The essential ingredient for these results is the resolution of Barvinok's log-concavity conjecture for contingency tables on lines, which was proven using ChatGPT 6 Astra. We conjecture a generalization of Barvinok's conjecture, which we believe will lead to stronger and more general bounds.
Innovation
Methods, ideas, or system contributions that make the work stand out.
Totally Unimodular Polytopes
Approximate Counting
Log-concavity
Gurvits Capacity
Variable-wise Log-concavity (VLC)
🔎 Similar Papers
No similar papers found.
