Log-concavity and Approximate Counting for Totally Unimodular Polytopes

Jonathan Leake; Maryam Mohammadi Yekta

Home/Archive/arXiv

arXiv · 2609.39917

Log-concavity and Approximate Counting for Totally Unimodular Polytopes

Jonathan Leake·Maryam Mohammadi Yekta

View original source ↗Read source document ↗Export metadata ↓

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.

Explore related subjects

math.CO cs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Jonathan Leake, Maryam Mohammadi Yekta. 2026-09-30. Log-concavity and Approximate Counting for Totally Unimodular Polytopes. https://arxiv.org/abs/2609.39917

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

A power series expansion of the Wilf function

In this work, the author employs the Faà di Bruno formula, identities for the partial Bell polynomials, two combinatorial identities, and the (logarithmically) complete monotonicity of generating functions for several integer sequences, together with the Wronski theorem, to investigate a collection of analytic and combinatorial structures. The study establishes Taylor series expansions for various functions involving the inverse (hyperbolic) tangent function and derives the Maclaurin expansion of the Wilf function, a composite of the inverse tangent, square root, and exponential functions. The coefficients in this expansion are expressed in terms of Stirling numbers of the second kind, and their generating functions, limits, positivity, monotonicity, and logarithmic convexity are analyzed. The paper further presents closed-form formulas for special values of the Gauss hypergeometric function and for certain partial Bell polynomials, along with several infinite series representations of the circular constant and related sequences. An asymptotic rational approximation to the circular constant is recovered, and connections among several integer sequences are established via determinants.

math.CO↗

arXiv2026

From finding a spanning subgraph $H$ to an $H$-factor

A typical Dirac-type problem in extremal graph theory is to determine the minimum degree threshold for a graph $G$ to have a spanning subgraph $H$, e.g. the Dirac theorem. A natural follow-up problem is to seek an $H$-factor, which is a spanning set of vertex-disjoint copies of $H$. In this short note, we present a method for obtaining an upper bound on the minimum degree threshold for an $H$-factor from one for finding a spanning copy of $H$. As an application, we prove that, for all $\varepsilon>0$ and sufficiently large $\ell$, any oriented graph $G$ on $\ell m$ vertices with minimum semi-degree $δ^0(G) \ge (3/8+ \varepsilon )\ell m$ contains a $C_\ell$-factor, where $C_\ell$ is an arbitrary orientation of a cycle on $\ell$ vertices. This improves a result of Wang, Yan and Zhang.

math.CO↗

arXiv2026

Localized Erdős-Pósa Property for Subdivisions

For a graph $H$, we say that $H$ has the Erdős-Pósa property for subdivisions with function $f$, if, for every nonnegative integer $k$ and every graph $G$, either $G$ contains (as a subgraph) $k+1$ pairwise vertex-disjoint subdivisions of $H$ or there exists a set $X\subseteq V(G)$ such that $G\setminus X$ contains no $H$-subdivision and $|X|\leq f(k)$. We show that every connected graph $H$ that has the Erdős-Pósa property for subdivision also satisfies a localized version of the Erdős-Pósa property, as follows. Let $H$ be a connected graph that has the Erdős-Pósa property for subdivisions with function $f$, and let $G$ be a graph that does not contain $k+1$ vertex-disjoint subdivisions of $H$. We demonstrate the existence of a set of at most $k$ vertex-disjoint subdivisions of $H$ in $G$ such that in their union, we can find a set $X$ with the property that $G \setminus X$ contains no $H$-subdivision and $|X| \leq 2^{f(k)}mk -k(m-n)$ where $n$ and $m$ are the number of vertices and edges.

math.CO↗