Search arXivSearch

arXiv · 2608.22541

Polytopal bases for barycentric subdivisions

Abstract

Several important fans studied at the interface of combinatorics and algebraic geometry arise from barycentric subdivisions of other fans; the central example is the braid arrangement. The collection of faces of the standard simplex forms a basis for the deformation cone of the braid arrangement, i.e. the cone of generalized permutahedra. We reinterpret this simplicial basis as the collection of deep truncations of the standard simplex, and systematically abstract this perspective to produce polytopal bases for the deformation cones of barycentric subdivisions of simplicial projective fans. We further demonstrate that these bases restrict to bases for deformation cones of fans obtained by a sequence of stellar subdivisions induced by a building set. When the starting polytope is smooth with all edge lengths equal to one, we show that we can upgrade our basis to a collection of flat truncations. We then investigate two extensions of the braid arrangement where we are able to further upgrade our flat truncation basis to an indecomposable polytopal basis: 1. the barycentric subdivision of the normal fan of a product of standard simplices and 2. the barycentric subdivision of the braid arrangement. We discuss connections to, and implications for, Archimedean solids and regular polytopes, permutahedral plates, root polytopes, permutoassociahedra, simple permutonestohedra, cosmohedra, omnitruncations of Coxeter permutahedra, bipermutahedra, $π$-colored fans, and tropical $α$ and $β$ classes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Spencer Backman, Federico Castillo. 2026-09-08. Polytopal bases for barycentric subdivisions. https://arxiv.org/abs/2608.22541

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

KEEP EXPLORING

Related papers

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO