Search arXivSearch

arXiv · 2102.11836

Fertilitopes

Abstract

We introduce tools from discrete convexity theory and polyhedral geometry into the theory of West's stack-sorting map $s$. Associated to each permutation $π$ is a particular set $\mathcal V(π)$ of integer compositions that appears in a formula for the fertility of $π$, which is defined to be $|s^{-1}(π)|$. These compositions also feature prominently in more general formulas involving families of colored binary plane trees called troupes and in a formula that converts from free to classical cumulants in noncommutative probability theory. We show that $\mathcal V(π)$ is a transversal discrete polymatroid when it is nonempty. We define the fertilitope of $π$ to be the convex hull of $\mathcal V(π)$, and we prove a surprisingly simple characterization of fertilitopes as nestohedra arising from full binary plane trees. Using known facts about nestohedra, we provide a procedure for describing the structure of the fertilitope of $π$ directly from $π$ using Bousquet-Mélou's notion of the canonical tree of $π$. As a byproduct, we obtain a new combinatorial cumulant conversion formula in terms of generalizations of canonical trees that we call quasicanonical trees. We also apply our results on fertilitopes to study combinatorial properties of the stack-sorting map. In particular, we show that the set of fertility numbers has density $1$, and we determine all infertility numbers of size at most $126$. Finally, we reformulate the conjecture that $\sum_{σ\in s^{-1}(π)}x^{\text{des}(σ)+1}$ is always real-rooted in terms of nestohedra, and we propose natural ways in which this new version of the conjecture could be extended.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Colin Defant. 2023-05-20. Fertilitopes. https://arxiv.org/abs/2102.11836

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