#Polytopes
Exponent Polytopes for Abstracting Chemical Reaction Networks into Formal Specification Models for Compositional Design of Biomolecular Circuits https://www.biorxiv.org/content/10.64898/2026.11.13.766398v1
November 17, 2026 at 11:01 AM
Exponent Polytopes for Abstracting Chemical Reaction Networks into Formal Specification Models for Compositional Design of Biomolecular Circuits https://www.biorxiv.org/content/10.64898/2026.11.13.766398v1
November 17, 2026 at 11:01 AM
Fit-LRP: Fitting Linear Relaxations to Polytopes for Neural Network Verification over Non-Convex Regions
Fit-LRP: Fitting Linear Relaxations to Polytopes for Neural Network Verification over Non-Convex Regions
State-of-the-art neural network verifiers evaluate linear relaxations over axis-aligned bounding boxes. However, verification domains in cyber-physical systems are rarely boxes. Reachability specifications, obstacle-avoidance constraints, and neural Lyapunov certificates typically yield oblique or non-convex polyhedral regions, over which box-based bounds become extremely loose. This paper proposes Fit-LRP (Fitting Linear Relaxations to Polytopes), a framework the implements exact optimization of affine bounds over non-convex domains (represented by unions of polytopes) by solving a sequence of small, low-dimensional linear programs. Our approach seamlessly enhances the final optimization step of LiRPA and $α,\! β$-CROWN branch-and-bound (BaB) algorithms. In BaB verification, approximating oblique constraints with axis-aligned splits causes severe combinatorial blowup and risks non-termination. By optimizing the final affine bound of a nonlinear function over the exact polyhedral state-space constraints our method eliminates box-induced over-approximations, enabling earlier search-tree pruning. On ARCH-COMP and neural Lyapunov benchmarks, Fit-LRP reduces branching on the hardest region by $47\times$, cuts worst-case verification time by $15\times$, and with region-wise partitioning, verifies on a single CPU $6.1\times$ faster than $α,\! β$-CROWN on a GPU.
arxiv.org
November 15, 2026 at 4:47 PM
Feihu Liu, Jinlong Tang, Sihao Tao, Zihao Zhang: The Zaks--Perles--Wills volume conjecture I: three-dimensional lattice polytopes https://arxiv.org/abs/2611.22337 https://arxiv.org/pdf/2611.22337 https://arxiv.org/html/2611.22337
November 18, 2026 at 6:47 AM
Suhyoung Choi, Yongho Seo: Reflection Character Varieties in $\mathrm{SL}_{\pm}(n,\mathbb{R})$ for $2$-Perfect Labeled Truncation Polytopes https://arxiv.org/abs/2611.21700 https://arxiv.org/pdf/2611.21700 https://arxiv.org/html/2611.21700
November 18, 2026 at 6:48 AM
I incidentally love the Grand Antiprism also because it sounds like such a fantasy villain name
"Fools! You think you've exhausted the stock of polytopes with old Wythoff's pitiful construction? Well, think again! It is I, the Grand Antiprism, here to prove you wrong beyond all doubt,"
Lmk once you get to the Grand Antiprism, of which I am still unsure why it's unique rather than in a larger series of double-antiprisms. A central ridge torus of tetrahedra can be made in arbitrary sizes, so you'd think there might be e.g. a 14×14 version with heptagonal antiprisms.
November 18, 2026 at 8:04 AM
Jan Pavl\'ik: Face lattices of polytopes and bipolar polytopes https://arxiv.org/abs/2611.13896 https://arxiv.org/pdf/2611.13896 https://arxiv.org/html/2611.13896
November 11, 2026 at 6:47 AM
Shin Hong, Jeongsoo Kim, Eunjeong Lee: Cluster-theoretic Newton--Okounkov polytopes of flag varieties of types $A_4$ and $B_2$ https://arxiv.org/abs/2611.13385 https://arxiv.org/pdf/2611.13385 https://arxiv.org/html/2611.13385
November 11, 2026 at 6:47 AM
Johannes Hofscheier, Benjamin Nill: Reflexive polytopes can have doubly exponentially many vertices https://arxiv.org/abs/2611.08819 https://arxiv.org/pdf/2611.08819 https://arxiv.org/html/2611.08819
November 9, 2026 at 6:46 AM
Jane Ivy Coons, Ben Hollering, Niharika Chakrabarty Paul: Polyhedral Geometry of Degree-Bounded Characteristic Imset Polytopes https://arxiv.org/abs/2611.09633 https://arxiv.org/pdf/2611.09633 https://arxiv.org/html/2611.09633
November 9, 2026 at 6:47 AM
Zhenkun Li, Jinmin Wang, Jing Yu: Infinitely many convex polytopes with dihedral angles bounded above by $\pi/2+\delta$ https://arxiv.org/abs/2611.09021 https://arxiv.org/pdf/2611.09021 https://arxiv.org/html/2611.09021
November 9, 2026 at 6:46 AM
Jie Wang, David Yost: Decomposable polytopes with few vertices https://arxiv.org/abs/2611.07472 https://arxiv.org/pdf/2611.07472 https://arxiv.org/html/2611.07472
November 6, 2026 at 6:47 AM
Hey AI, good luck completing my program from the instructions.
github.com/individkid/i...
intxface/TODO at 4baef0b1aaa939c85b1b3dd64cf0b6c9a9242583 · individkid/intxface
interface and intraface between processes for polytopes and more - individkid/intxface
github.com
November 5, 2026 at 5:13 PM
📚 New Arxiv Paper

Title: On Universal Minkowski Classes of Polytopes: Theory and Applications
Authors: Boris Houska, Matthias A. M\"uller, Mario Eduardo Villanueva

Read more: https://arxiv.org/abs/2610.41966
November 2, 2026 at 8:02 AM
Thomas Magnuson, Tyrrell McAllister: Berenstein-Zelevinsky polytopes for type $\mathrm{G}_{2}$ https://arxiv.org/abs/2610.42038 https://arxiv.org/pdf/2610.42038 https://arxiv.org/html/2610.42038
November 2, 2026 at 6:47 AM
Evgeny Feigin, Igor Makhlin: Truncated Grassmannians: polytopes, representations, and Cauchy formulas https://arxiv.org/abs/2610.40891 https://arxiv.org/pdf/2610.40891 https://arxiv.org/html/2610.40891
November 2, 2026 at 6:46 AM
Ryo Uchiumi: Equivariant Ehrhart series for rational simplices and rational cross-polytopes https://arxiv.org/abs/2610.41529 https://arxiv.org/pdf/2610.41529 https://arxiv.org/html/2610.41529
November 2, 2026 at 6:47 AM
Boris Houska, Matthias A. M\"uller, Mario Eduardo Villanueva: On Universal Minkowski Classes of Polytopes: Theory and Applications https://arxiv.org/abs/2610.41966 https://arxiv.org/pdf/2610.41966 https://arxiv.org/html/2610.41966
November 2, 2026 at 6:50 AM
Alexander Kolpakov: Sharp dimension bounds for right-angled hyperbolic polytopes https://arxiv.org/abs/2610.38900 https://arxiv.org/pdf/2610.38900 https://arxiv.org/html/2610.38900
October 30, 2026 at 6:48 AM
Lines only: 4 new works.
Fibonacci Word Fractals · Polar stitches · 4D Polytopes · Cesàro Curves
Browse all 500+ forms — digitallineart.com.
#generativeart #lineart
October 28, 2026 at 5:02 PM
📚 New Arxiv Paper

Title: Verifying Control Invariance of H-Polytopes is coNP-Complete
Authors: Mario Eduardo Villanueva, Boris Houska

Read more: https://arxiv.org/abs/2610.36773
October 28, 2026 at 8:02 AM
Mario Eduardo Villanueva, Boris Houska: Verifying Control Invariance of H-Polytopes is coNP-Complete https://arxiv.org/abs/2610.36773 https://arxiv.org/pdf/2610.36773 https://arxiv.org/html/2610.36773
October 28, 2026 at 6:50 AM
🔄 Updated Arxiv Paper

Title: 0/1 integer programming over polytopes of Chv\'atal rank one is as hard as lattice problems
Authors: Alberto Del Pia

Read more: https://arxiv.org/abs/2610.10911
October 27, 2026 at 8:02 AM
Yegor Gorodzha, Steven Hoehner, Gil Kur: Approximating the Euclidean Ball by Polytopes: Surprising Rates in High Dimensions https://arxiv.org/abs/2610.34651 https://arxiv.org/pdf/2610.34651 https://arxiv.org/html/2610.34651
October 27, 2026 at 6:49 AM
Federico Castillo, Guillermo Pi\~neda-Villavicencio, Jos\'e Alejandro Samper: Equifacetted polytopes whose facets are products of simplices: The simplicial prism case https://arxiv.org/abs/2610.32035 https://arxiv.org/pdf/2610.32035 https://arxiv.org/html/2610.32035
October 26, 2026 at 6:47 AM