Id: palomar/PALOMAR-2026-11-19-000028 Url: https://github.com/caiusdfolkerts/research/tree/2770695745f82092647619d29714ebe6be661001/mixed_volume_realization_clean Json: https://data.palomar-registry.org/entries/PALOMAR-2026-11-19-000028-v1.json Repo: https://github.com/caiusdfolkerts/research Tags: math.MG, msc:52A38, msc:03D35 Score: 0 Title: Undecidability of mixed-volume realization Trust: high Domain: math.MG Source: palomar Authors: Caius Folkerts Reviews: 0 Subject: math.MG Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Verified: true Discussed: 0 Published: 2026-11-19 Formalized: true Formalizes: title=Undecidability of mixed-volume realization identifier= relationship=formalizes Formalizes: title=Supporting polytope proofs adapted from openai/math identifier= relationship=adapts Page: https://delphi.science/r/palomar/PALOMAR-2026-11-19-000028 Rational membership in the complete forty-four-body cubic coefficient locus is co-recursively enumerable complete even for nonnegative coefficients, with point-padding extensions. For rational automata with at least one alphabet letter, the uniform algorithm produces the complete cubic array and the quadratic section whose realizability is equivalent to the universal cutpoint condition. Corollary 5.1 fixes a rational quadratic family from the probability simplex in R28 to cubic coefficient arrays for 91 bodies. Even when a rational coefficient input is promised to lie in the real image of…