Search arXivSearch

arXiv · 2311.07328

Factorization structures, cones, and polytopes

Abstract

Factorization structures occur in toric differential and discrete geometry, and can be viewed in multiple ways, e.g., as objects determining substantial classes of explicit toric Sasaki and Kähler geometries, as special coordinates on such, or as an apex generalisation of cyclic polytopes featuring a generalised Gale's evenness condition. This article presents a comprehensive study of factorization structures. It establishes their structure theory and introduces their use in the geometry of cones and polytopes. The article explains the construction of polytopes and cones compatible with a given factorization structure, and exemplifies it for product Segre-Veronese and Veronese factorization structures, where the latter case includes cyclic polytopes. Further, it derives the generalised Gale's evenness condition for compatible cones, polytopes and their duals, and explicitly describes faces of these. Factorization structures naturally provide generalised Vandermonde identities, which relate normals of any compatible polytope, and which are used for Veronese factorization structure to find examples of Delzant and rational Delzant compatible polytopes. The article offers a myriad of factorization structure examples, which are later characterised to be precisely factorization structures with decomposable curves, and raises the question if these encompass all factorization structures, i.e., the existence of an indecomposable factorization curve.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roland Púček. 2026-01-18. Factorization structures, cones, and polytopes. https://doi.org/10.1017/prm.2025.10046

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