Power Concavity of Low-Dimensional Unimodular Fiber Counts
Loading original first page…
Abstract
We prove a corrected fourth-root Jensen inequality for unimodular integer fibers whose central affine dimension is at most three. For an integrable integer-valued demand A with feasible fibers almost surely and integral mean b, a bounded nonempty central fiber satisfies E[(N(A)−1/12)^(1/4)]≤(N(b)-1/12)^(1/4). This implies a 2/11-power inequality and logarithmic Jensen, with finite expectations and countable support. The proof constructs a monotone continuous extension of type-A₃ lattice counts with all twelve directed bounds varying. A quartic Lorentzian certificate gives the corrected fourth root; shortest-path closure and a common integral rank-three reduction transfer it to arbitrary unimodular systems. For this specified continuous count extension, 2/11 is the largest concavity power and 1/12 is the least fourth-root correction. Endpoint-count thresholds give stronger powers tending to 1/4. We also prove sharp corrected square-root Jensen in dimension two and its optimal leading large-count exponent deficit. For the complete acyclic four-vertex digraph, the classical continuous count extension has optimal power 4/13, while exact integral examples obstruct cube-root Jensen. Directed rounding and a full-dimensional local obstruction explain the role of a global continuous extension.
Read the full paper in the original PDF.
Edition files
- Paper.pdf174.6 KiB · pdf
SHA-256
41850703a57f90c81296e08388e5f2611df7adc37cfb465fe7fbcd529a382ba1 - Publication_Package.zip209.0 KiB · package
SHA-256
6c17620f514953546ceb7653e1141e85066a30fdded5b0d6a5319b546c721a08
Available editions
Research details
- Subjects
- Mathematics · Combinatorics and Graph Theory
- Keywords
- unimodular fibers, integer flows, power concavity, lattice-point counts, Kostant partition function, Brunn–Minkowski inequality
- Manuscript date
- 2026-10-22
- Reader reuse
- none
Scope
Corrected fourth-root Jensen for unimodular integer fibers of central affine dimension at most three, including countable integrable demands. Sharp correction and extension-specific powers, endpoint refinements, planar results and separate continuous-extension versus integral-demand obstructions retain their stated domains.
Disclosures
AI-assisted tools supported research exploration, literature review, manuscript preparation and internal verification. The author retains responsibility for the work. Internal AI-assisted and computational checks are distinct from external human peer review.
Reproduction
The 21-page manuscript and complete editable source are supplied in a 10-member public package. README.txt gives build instructions, dependencies and reproduction scope. Build reproduction is qualified by the compiler, support files and timestamp settings specified in the supplied instructions. The mathematical conclusions have analytic proofs; accompanying finite checks, where present, retain the limited scopes stated in the package.
References and related resources
- J. Leake and M. Mohammadi Yekta, Log-concavity and Approximate Counting for Totally Unimodular Polytopes, arXiv:2609.39917v1 (2026). arxiv.org/abs/2609.39917.
- A. Khare, J. P. Matherne and A. St. Dizier, Log-concavity of characters of parabolic Verma modules, and of restricted Kostant partition functions , arXiv:2504.01623v2 (2025). arxiv.org/abs/2504.01623.
- J. A. De Loera and B. Sturmfels, Algebraic unimodular counting , Math. Program. 96 (2003), 183–203. arXiv:math/0104286.
- T. Lam and A. Postnikov, Alcoved polytopes I , Discrete Comput. Geom. 38 (2007), 453–478. arXiv:math/0501246.
- T. Lam and A. Postnikov, Alcoved polytopes II , arXiv:1202.4015 (2012). arxiv.org/abs/1202.4015.
- D. Alonso-Gutiérrez, M. A. Hernández Cifre and J. Yepes Nicolás, Further inequalities for the (generalized) Wills functional , Commun. Contemp. Math. 23 (2021), 2050011. arxiv.org/abs/1912.07993.
- D. Iglesias, J. Yepes Nicolás and A. Zvavitch, Brunn–Minkowski type inequalities for the lattice point enumerator. Author manuscript (2019) .
- A. Barvinok, Brunn–Minkowski inequalities for contingency tables and integer flows , Adv. Math. 211 (2007), 105–122. doi:10.1016/j.aim.2006.07.012.
- J. Leake and A. H. Morales, Capacity bounds on integral flows and the Kostant partition function, arXiv:2406.07838v3 (2024). arxiv.org/abs/2406.07838.
- J. Tarski, The partition function for certain simple Lie algebras , Technical Report No. 7, AFOSR TN58-657 (AD162188), Department of Mathematics, University of California, Berkeley (August 1958). HathiTrust scan.