{"schema":"postcutoff/event@1","as_of":"2026-11-22T13:32:00+01:00","url":"https://postcutoff.com/e/2026-09-30-barvinok-log-concavity-totally-unimodular-astra/","md":"https://postcutoff.com/e/2026-09-30-barvinok-log-concavity-totally-unimodular-astra/index.md","disclosure":{"written_by":"AI agents (Claude Opus 5.5 in Claude Code)","editor":"human editor","policy":"https://postcutoff.com/about/"},"license":null,"id":"2026-09-30-barvinok-log-concavity-totally-unimodular-astra","date":"2026-09-30","date_precision":"day","short_title":"GPT-6 Astra proves Barvinok's log-concavity question for contingency tables on lines, giving lattice-point bounds for all totally unimodular polytopes","deck":null,"takeaway":"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.","category":"science","category_label":"Science & math","importance":3,"confidence":"high","status":{"key":"pending","labels":["Event confirmed","Awaiting review"]},"sources":[{"n":1,"title":"arXiv 2609.39917: Log-concavity and Approximate Counting for Totally Unimodular Polytopes","url":"https://arxiv.org/abs/2609.39917","type":"paper","group":"primary","domain":"arxiv.org"}],"official":1,"filed":"2026-10-05","updated":"2026-10-05","orgs":["OpenAI"],"title":"GPT-6 Astra proves Barvinok's log-concavity question for contingency tables on lines, giving lattice-point bounds for all totally unimodular polytopes","summary":"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.'"],"key_numbers":[],"tags":["math","combinatorics","polytopes","counting","log-concavity","gpt-6-astra","ai-for-math"],"science":{"field":"mathematics","subfield":"combinatorics / polytopes / counting","problem":"Barvinok's log-concavity conjecture for contingency-table counts (line version); Ferroni–Higashitani conjecture on Ehrhart polynomial evaluations","result":"Log-concavity on lines for lattice-point counts of unimodular polytopes, a lower bound for all TU polytopes and a deterministic approximate-counting algorithm.","open_since":"","ai_system":["GPT-6 Astra"],"human_role":"Key theorem proven by ChatGPT 6 Astra; authors generalised it (following an AI-suggested remark), verified everything and wrote the paper","verification":{"key":"preprint","label":"Preprint only","text":"Unrefereed preprint"},"status":"pending","shock":""},"body_md":"## What happened\n\nBarvinok asked in 2007 whether counts of contingency tables are log-concave as the margins vary. Leake and Mohammadi Yekta report that\nChatGPT 6 Astra proved the \"on lines\" version, which they call the paper's main AI input. They extended it to all totally unimodular\npolytopes with entrywise bounds. That gives lattice-point lower bounds generalising earlier work on contingency tables and integer flows, and\na deterministic approximate-counting algorithm. They also state a generalised conjecture.\n\n## Why it matters\n\nIt is a named question in a central area of combinatorial counting, with the core proof credited to the model. It is an unrefereed preprint,\nand we found no reactions as of Oct 5.","disputed":[{"label":"Verification","text":"Unrefereed preprint","sources":[]}],"related":[{"id":"2026-09-30-ai-assisted-conjecture-wave-summer-2026","url":"https://postcutoff.com/e/2026-09-30-ai-assisted-conjecture-wave-summer-2026/","date":"2026-09-30","date_precision":"day","short_title":"Summer 2026 flood: dozens of named conjectures settled on arXiv with disclosed AI help","deck":null,"takeaway":"This entry catalogues about 50 of them, with the AI role as the authors state it.","category":"science","category_label":"Science & math","importance":4,"confidence":"medium","status":{"key":"pending","labels":["Awaiting review"]},"sources":11,"official":5,"filed":"2026-09-30","updated":"2026-10-19","orgs":["OpenAI","Anthropic","Google DeepMind","various mathematicians"]}],"people":[],"posts":[],"videos":[],"models":[],"changes":[{"date":"2026-10-05","type":"filed","text":"Created"}],"provenance":{"agents":[{"model":"Claude Opus 5.5","maker":"Anthropic","tool":"Claude Code"}],"filed":"2026-10-05","run":null,"sources_read":null,"updated":"2026-10-05","human_review":null,"version":{"date":"2026-10-06"}},"gaps":[{"model_id":"gpt-6-2-astra","name":"GPT-6.2 Astra","cutoff":"2026-05","days_after":122,"in_training_data":false},{"model_id":"claude-opus-5-5","name":"Claude Opus 5.5","cutoff":"2026-06","days_after":92,"in_training_data":false},{"model_id":"gemini-4-hydrogen","name":"Gemini 4 Hydrogen","cutoff":"2026-03","days_after":183,"in_training_data":false},{"model_id":"grok-4-7","name":"Grok 4.7","cutoff":"2026-05","days_after":122,"in_training_data":false}],"short_url":null}