Search arXivSearch

arXiv · 2504.07272

Canonical forms of polytopes from adjoints

Abstract

Projectivizations of pointed polyhedral cones $C$ are positive geometries in the sense of Arkani-Hamed, Bai, and Lam. Their canonical forms look like $$ Ω_C(x)=\frac{A(x)}{B(x)} dx, $$ with $A,B$ polynomials. The denominator $B(x)$ is just the product of the linear equations defining the facets of $C$. We will see that the numerator $A(x)$ is given by the adjoint polynomial of the dual cone $C^{\vee}$. The adjoint was originally defined by Warren, who used it to construct barycentric coordinates in general polytopes. Confirming the intuition that the job of the numerator is to cancel unwanted poles outside the polytope, we will see that the adjoint is the unique polynomial of minimal degree whose hypersurface contains the residual arrangement of non-face intersections of supporting hyperplanes of $C$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christian Gaetz. 2025-04-09. Canonical forms of polytopes from adjoints. https://arxiv.org/abs/2504.07272

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

KEEP EXPLORING

Related papers

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

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