#polytope
i don't think we know what 2027 will be yet but i'm hoping for high dimensional polytope girls or perhaps alkaline earth metal girls
November 21, 2026 at 6:39 AM
is that a planet or a polytope
November 17, 2026 at 9:34 AM
C’est drôle car le premier collectif d’impro sonore que j’avais monté (1996-2002) s’appelait PolytRopes, et je savais pas du tout !
Pour moi c’était un jeu sur polytope (comme ceux de Xenakis) et isotrope
November 19, 2026 at 10:53 PM
Computer, prove or disprove: every convex polytope admits a non-overlapping net. Make no mistakes. Do a breakthrough.
November 16, 2026 at 7:59 PM
Jiahang Liu, Jinlong Tang: Proof of Stanley's Conjecture on the Leading Ehrhart Coefficients of the Birkhoff Polytope https://arxiv.org/abs/2611.25973 https://arxiv.org/pdf/2611.25973 https://arxiv.org/html/2611.25973
November 20, 2026 at 6:47 AM
Jan Snellman: Hilbert functions over the exterior algebra and f-vectors in higher rank III: Lattice points of the Kozlov polytope https://arxiv.org/abs/2611.26110 https://arxiv.org/pdf/2611.26110 https://arxiv.org/html/2611.26110
November 20, 2026 at 6:47 AM
Feng Chen, Kumarsinh Jhala, Kiran Kumar Challa, Zongjie Wang: Facet-offset Polytope Expansion for Dynamic Operating Envelopes of Aggregated Distribution Grid Resources https://arxiv.org/abs/2611.22081 https://arxiv.org/pdf/2611.22081 https://arxiv.org/html/2611.22081
November 18, 2026 at 6:46 AM
In 4D we can analogously stack two of any polyhedron right on top of each other: joining two per face as in any polytope but also degenerately, two per edge, two per vertex. But, we also have constructions with *three* per edge and vertex!
November 18, 2026 at 8:56 AM
This is still degenerate/flat, any nonzero-angle polytope construction requires 4 or more cells per vertex (in order for the vertex figure to be itself a polyhedron), but it seems qualitatively different e.g. in that three-per-edge means these stay actual edges when inflated.
November 18, 2026 at 8:56 AM
AI agents can now mathematically map safe operational boundaries for linear systems using the new invariant-set-polytope-calculator.
November 13, 2026 at 1:52 PM
> In the shifts generated by interval exchanges (“dendric” shifts), every extension graph is a tree.
November 18, 2026 at 9:01 AM
Gah, I do that all the time. And “Fano” for “fan” is a common one too — my fingers just can’t resit that extra letter. “Polynomial” has a habit of becoming “polytope”. Basically I’ve broken my mind.
November 11, 2026 at 8:17 PM
Yoonsung Choi, Sunghee Choi: The Containment Polytope of a Triangle and a Convex Polygon https://arxiv.org/abs/2611.08556 https://arxiv.org/pdf/2611.08556 https://arxiv.org/html/2611.08556
November 9, 2026 at 6:39 AM
LifeWiki and Polytope Wiki were never on there but Googology Wiki still is
November 6, 2026 at 3:39 PM
Apologies for bringin' the mood down on this fine #Novmemeber morning, but I'm getting to the end of revisions on Lonely Ship, ready to release the finale, and the mood is sombre.

Here's a banger I came across recently that reminds me of the endgame.

youtu.be/QYDza3BLr1w?...
November 6, 2026 at 9:05 AM
arXiv📈🤖
When Do Sports Leagues Stop Being Competitive? Bayesian Detection of Competitive-Balance Eras from Match-Level Data
By Li, Xu, Hu
November 6, 2026 at 11:38 AM
What is the graph of the polytope?
November 3, 2026 at 9:00 AM
Characterizes input-output behaviors achievable through declared communication schedules using reachability analysis and polytope methods. Proves affine hull determined entirely by which inputs can reach agent outputs, with single binary messages conveying full informational r...
Certifying Information Flow in Multi-Agent Systems
arxiv.org
November 1, 2026 at 12:37 PM
Caractérise les comportements d'entrée-sortie réalisables via les calendriers de communication déclarés en utilisant l'analyse de réachabilité et les méthodes de polytope. Prouve que l'enveloppe affine est entièrement déterminée par les entrées pouvant atteindre les sorties de...
Certification du flux d'information dans les systèmes multi-agents
iq.fp2.dev
November 1, 2026 at 12:35 PM
SILT#00459: It's interesting seeing something that looks like Wikipedia but is actually there for specific niches. Branch out more beyond Wikipedia to see what you can learn. Learned that a hexagon with alternating sizes for their sides is called a ditrigon: polytope.miraheze.org/wiki/Ditrigon
Ditrigon - Polytope Wiki
The ditrigon is a convex semi-uniform hexagon. As such it has 6 sides that alternate between two edge lengths, with each vertex joining one side of each length....
polytope.miraheze.org
October 29, 2026 at 6:56 AM
Noncontextuality inequalities for prepare-transform-measure scenarios
Quantum 10, 2250 (2026). https://doi.org/10.22331/q-2026-10-27-2250 We provide the first systematic technique for deriving witnesses of contextuality in prepare-transform-measure scenarios. More specifically, we show how linear quantifier elimination can be used to compute a polytope of correlations consistent with generalized noncontextuality in such scenarios. This polytope is specified as a set of noncontextuality inequalities that are necessary and sufficient conditions for observed data in the scenario to admit of a classical explanation relative to any linear operational identities, if one ignores some constraints from diagram preservation. While including these latter constraints generally leads to tighter inequalities, it seems that nonlinear quantifier elimination would be required to systematically include them. We also provide a linear program which can certify the nonclassicality of a set of numerical data arising in a prepare-transform-measure experiment. We apply our results to get a robust noncontextuality inequality for transformations that can be violated within the stabilizer subtheory. Finally, we give a simple algorithm for computing all the linear operational identities holding among a given set of states, of transformations, or of measurements.
quantum-journal.org
October 27, 2026 at 9:45 PM
Yushan Qu, Jon Lee: On the facets of the Cayley polytope of Stanley's triangulation https://arxiv.org/abs/2610.35668 https://arxiv.org/pdf/2610.35668 https://arxiv.org/html/2610.35668
October 27, 2026 at 6:48 AM
Ali Aliev, Natalia Amburg: The Number of Polytope Trees and Beyond https://arxiv.org/abs/2610.33344 https://arxiv.org/pdf/2610.33344 https://arxiv.org/html/2610.33344
October 27, 2026 at 6:47 AM
Alexander Lindermayr, Sven J\"ager, Bart Zondervan
Single-Machine Guarantees on Unrelated Machines and Beyond: Proportional Fairness for Nonclairvoyant Polytope Scheduling
https://arxiv.org/abs/2610.32545
October 27, 2026 at 4:56 AM