Search arXivSearch

arXiv · 2605.27828

Sprout Symmetric Functions: Part 1

Abstract

A \emph{sprout sequence} is a sequence $\frakr=(R_0=1,R_1,R_2,\dots)$ of symmetric functions in the variables $\bmx=(x_1,x_2,\dots)$ over a field $K$ generated from a power series $F(t)=1+a_1t+a_2t^2+\cdots$ by the rule $\sum_{n\geq 0}R_nt^n = \prod_{i\geq 1} F(x_it)$. The power series $F(t)$ is called the \emph{seed} of $\frakr$. This concept originated in the work of Littlewood and Richardson (though not with the name ``sprout sequence''), and numerous examples of sprout sequences have appeared in the literature. They are related to chromatic Tutte polynomials of complete graphs and complete hypergraphs, binomial posets, upper homogeneous (upho) posets, topological genera, etc. We first develop the basic theory of sprout sequences and then look at the special case $F(t)=\sec(\sqrt{t})$. We give five characterizations of sprout sequences and consider the expansion of sprout symmetric functions in terms of well-known symmetric function bases. The Schur positivity, elementary symmetric function positivity, and complete homogeneous symmetric function positivity of $R_n$ for all $n$ are completely characterized using the Edrei-Thoma theorem from the theory of total positivity. The seed $F(t)=\sec(\sqrt{t})$ is especially interesting. The expansion of $R_n$ in the power sum or monomial basis is related to alternating permutations. The Schur function expansion is related to standard Young skew tableaux. The expansion in terms of the complete symmetric functions has nonnegative integer coefficients, but we don't know a combinatorial interpretation. Finally we give a formula for $R_n$ as a sum of chromatic symmetric functions of interval orders.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tewodros Amdeberhan, John Shareshian, Richard P. Stanley. 2026-05-27. Sprout Symmetric Functions: Part 1. https://arxiv.org/abs/2605.27828

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

Random algebraic constructions for extremal and Ramsey problems

Building on Bukh's random algebraic method, we develop a framework for extremal and Ramsey problems involving apex hypergraphs. If $\mathcal{H}$ is a $(d-1)$-partite $(d-1)$-uniform hypergraph with $S$ edges and $\mathcal{H}(t)$ is obtained by adjoining $t$ vertices with common link $\mathcal{H}$, we prove that $\operatorname{ex}(n,\mathcal{H}(t))=Ω_{\mathcal{H}}(n^{d-1/S})$ for $t>9^{S+o_d(S)}$, which is best possible when $\mathcal{H}$ is Sidorenko. Our framework also yields sharper sided Zarankiewicz bounds, quantitative generalized Tur'an bounds, and diagonal multicolor Ramsey constructions. For each fixed $s\geq 2$ and $K\geq 3$, we further prove $\operatorname{r}_K(\mathcal K_{s,t};\mathcal K_n) =Θ_{s,t,K}((n/\log n)^s)$ for $t>9^{s+o(s)}$, extending a theorem of Alon and Rödl from factorial to exponential $t$. The main ingredients are interpolation on $m$-independent varieties, control of the dependencies imposed by symmetry, and linear spaces of forms whose nonzero members remain regular after a common algebraic slice. Limited edge independence then gives the spectral and local-density estimates needed for the Ramsey application.

math.CO

A note on vertex-critical induced subgraphs of shift graphs

Shift graphs, introduced by Erdős and Hajnal in 1964, form one of the simplest known non-recursive constructions of triangle-free graphs with arbitrarily large chromatic number. In this note, we identify a surprising property: for each integer $k \geq 1$, the smallest $k$-chromatic shift graph contains a \emph{unique} induced $k$-vertex-critical subgraph. We give an explicit description of this subgraph and prove its uniqueness. This provides a new family of vertex-critical triangle-free graphs of arbitrarily large chromatic number.

math.CO