Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.08101

Dual Lattice Functions of Polytopes

Yibo Gao·Thomas Lam·Lei Xue
View original source ↗Read source document ↗Export metadata ↓

Abstract

We define the dual lattice function of a rational polytope $P$ via the discrete Laplace transform of the exponential of its support function. This definition is a discrete analogue of the dual volume function of a polytope that the authors studied in previous work. We show that the dual lattice function is valuative, and by multiplying with the torus form, it becomes the canonical form of the exponential polytope $\mathrm{exp}(P)$ as a positive geometry. This result suggests the study of the class of toric polytopes, which are certain semialgebraic subsets of projective toric varieties. Our work is a first step towards discretization of positive geometries in the simplest case of polytopes.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yibo Gao, Thomas Lam, Lei Xue. 2026-07-09. Dual Lattice Functions of Polytopes. https://arxiv.org/abs/2607.08101

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗