Search arXivSearch

arXiv · 2508.04275

The canonical form, scissors congruence and adjoint degrees of polytopes

Abstract

We study the canonical form $Ω$ as a valuation in the context of scissors congruence for polytopes. We identify the degree of its numerator - the adjoint polynomial $\operatorname{adj}_P$ - as an important invariant in this context. More precisely, for a polytope $P$ we define the degree drop that measures how much smaller than expected the degree of the adjoint polynomial of $P$ is. We show that this drop behaves well under various operations, such as decompositions, restrictions to faces, projections, products and Minkowski sums. Next we define the reduced canonical form $Ω_0$ and show that it is a translation-invariant 1-homogeneous valuation on polytopes that vanishes if and only if $P$ has positive degree drop. Using it we can prove that zonotopes can be characterized as the $d$-polytopes that have maximal possible degree drop $d-1$. We obtain a decomposition formula for $Ω_0$ that expresses it as a sum of edge-local quantities of $P$. Finally, we discuss valuations $Ω_s$ that can distinguish higher values of the degree drop.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tom Baumbach, Ansgar Freyer, Julian Weigert, Martin Winter. 2025-08-06. The canonical form, scissors congruence and adjoint degrees of polytopes. https://arxiv.org/abs/2508.04275

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO