arXiv subjects

Torben Donzelmann

Publications and source records attributed to Torben Donzelmann.

5 recordsLinked to original sources

arXiv2026

Central limit theorems for high dimensional lattice polytopes: cosmological polytopes

We study cosmological polytopes induced by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These graph-based lattice polytopes form a natural model of random lattice polytopes in which geometric features are determined by the structure of the underlying random graph. Focusing on the number of polytope edges and on the number of edges in unimodular triangulations, we derive asymptotic formulas for expectations and variances and prove quantitative central limit theorems in the relevant parameter regime. The analysis relies on explicit graph-theoretic descriptions of the corresponding edge sets and on the discrete Malliavin--Stein method for normal approximation.

math.CO↗

arXiv2026

Central limit theorems for high dimensional lattice polytopes: symmetric edge polytopes

We investigate symmetric edge polytopes generated by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These objects provide a natural and largely unexplored model of random lattice polytopes, in which geometric properties are governed by graph-theoretic structure. Focusing on the number of polytope edges and on the number of edges in unimodular triangulations, we derive precise asymptotics for expectations and variances and establish central limit theorems with explicit rates of convergence. Our analysis combines a detailed combinatorial-geometric study of the graph configurations determining the facial structure with the discrete Malliavin--Stein method for normal approximation. In particular, we identify a distinguished parameter value at which the leading variance term cancels, producing an atypical fluctuation regime. To the best of our knowledge, the results obtained here constitute the first distributional limit theorems for random lattice polytopes

math.CO↗

arXiv2026

On cosmological polytopes, their canonical forms and their duals

We compute the canonical form of the cosmological polytope for any graph in terms of the dual of the shifted cosmological polytope in two different ways. On the way, we provide an explicit coordinate description of the dual of the cosmological polytope. Moreover, we construct two triangulations of the dual cosmological polytope in terms of maximal and almost maximal tubings of the underlying graph. Though the existence of the first triangulation was already suggested by Arkani-Hamed, Benincasa and Postnikov, the second is completely new and, in particular, gives rise to a new expression of the canonical form of the cosmological polytope.

math.CO↗

arXiv2026

Symmetric (co)homology polytopes

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological properties of a simplicial complex can be translated into geometric properties of such polytopes, and vice versa. We study the integer decomposition property, facets and reflexivity of these polytopes. Using Gr\"obner basis techniques, we obtain a (not necessarily unimodular) triangulation of these polytopes. Due to the tools we use, most of our results hold in the more general setting of arbitrary centrally symmetric polytopes.

math.CO↗

arXiv2024

Crossing Numbers of Beyond Planar Graphs Re-revisited: A Framework Approach

Beyond planarity concepts (prominent examples include k-planarity or fan-planarity) apply certain restrictions on the allowed patterns of crossings in drawings. It is natural to ask, how much the number of crossings may increase over the traditional (unrestricted) crossing number. Previous approaches to bound such ratios, e.g. [arXiv:1908.03153, arXiv:2105.12452], require very specialized constructions and arguments for each considered beyond planarity concept, and mostly only yield asymptotically non-tight bounds. We propose a very general proof framework that allows us to obtain asymptotically tight bounds, and where the concept-specific parts of the proof typically boil down to a couple of lines. We show the strength of our approach by giving improved or first bounds for several beyond planarity concepts.

cs.CG↗