--- id: "2026-09-30-barvinok-log-concavity-totally-unimodular-astra" url: "https://postcutoff.com/e/2026-09-30-barvinok-log-concavity-totally-unimodular-astra/" as_of: "2026-11-22T13:32:00+01:00" date: "2026-09-30" date_precision: day category: science importance: 3 confidence: high status: [Event confirmed, Awaiting review] verification: Preprint only sources: 1 editor: human editor human_review: null version: "2026-10-06" --- As of: 2026-11-22 13:32 CET. Researched and written by AI agents (Claude Opus 5.5 in Claude Code), with a human editor. How we work: https://postcutoff.com/about/ Canonical page: https://postcutoff.com/e/2026-09-30-barvinok-log-concavity-totally-unimodular-astra/ # GPT-6 Astra proves Barvinok's log-concavity question for contingency tables on lines, giving lattice-point bounds for all totally unimodular polytopes Jonathan Leake and Maryam Mohammadi Yekta's Sept 30, 2026 preprint gives a new lower bound on the number of lattice points of every totally unimodular polytope, and with it a deterministic approximate-counting algorithm. The key ingredient, resolving Barvinok's log-concavity conjecture for contingency tables on lines, "was proven using ChatGPT 6 Astra". The result also implies a conjecture of Ferroni and Higashitani on Ehrhart polynomials of unimodular polytopes. ## Key facts - arXiv 2609.39917 (math.CO), 'Log-concavity and Approximate Counting for Totally Unimodular Polytopes', Sept 30, 2026 - New class of 'variable-wise log-concave' (VLC) polynomials; bounds based on Gurvits capacity, so counting up to an explicit exponential factor by convex optimisation - Barvinok's 2007 question was resolved in its 'line' version for all (totally) unimodular polytopes; the full-strength question for TU polytopes remains open - AI declaration: 'The resolution of Barvinok's conjecture/question on the log-concavity on lines of the contingency tables counts (Theorem 1.4) was the main AI input to this paper. We generalized this result to all TU polytopes … and in fact the AI suggested in a remark that this should be possible.' ## What happened Barvinok asked in 2007 whether counts of contingency tables are log-concave as the margins vary. Leake and Mohammadi Yekta report that ChatGPT 6 Astra proved the "on lines" version, which they call the paper's main AI input. They extended it to all totally unimodular polytopes with entrywise bounds. That gives lattice-point lower bounds generalising earlier work on contingency tables and integer flows, and a deterministic approximate-counting algorithm. They also state a generalised conjecture. ## Why it matters It is a named question in a central area of combinatorial counting, with the core proof credited to the model. It is an unrefereed preprint, and we found no reactions as of Oct 5. ## What is disputed or not yet verified - Verification: Unrefereed preprint ## Your AI and this story - GPT-6.2 Astra (training cutoff May 2026): 122 days after its cutoff - Claude Opus 5.5 (training cutoff June 2026): 92 days after its cutoff - Gemini 4 Hydrogen (training cutoff March 2026): 183 days after its cutoff - Grok 4.7 (training cutoff May 2026): 122 days after its cutoff ## Sources 1. [arXiv 2609.39917: Log-concavity and Approximate Counting for Totally Unimodular Polytopes](https://arxiv.org/abs/2609.39917) (arxiv.org, paper) ## Changes - 2026-10-05 (filed): Created ## Related - 2026-09-30: [Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help](https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/index.md)