Search arXivSearch

arXiv · 2411.13702

Veronese polytopes: Extending the framework of cyclic polytopes

Abstract

This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve in affine charts. We describe their facial structure by extending Gale's evenness condition, and provide a further combinatorial characterisation of facets via $σ$-parity alternating sequences. Notably, we establish a bijective correspondence between combinatorial types of Veronese polytopes and partitions of finite sets equipped with a cyclic order, called circular compositions. We show that, although the only Veronese $3$-polytopes are the cyclic $3$-polytopes and the octahedron, in general dimension they form a rich and diverse class including all combinatorial types of simplicial $d$-polytopes with at most $d+3$ vertices, the cross-polytope and particular stacked polytopes. In addition, we characterise which curves defining Veronese polytopes are $d$-order curves, and provide a closed formula for the number of facets of any Veronese polytope.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marie-Charlotte Brandenburg, Roland Púček. 2024-11-20. Veronese polytopes: Extending the framework of cyclic polytopes. https://arxiv.org/abs/2411.13702

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