Search arXivSearch

arXiv · 1904.06630

Flagged $(\mathcal{P},ρ)$-partitions

Abstract

We introduce the theory of $(\mathcal{P},ρ)$-partitions, depending on a poset $\mathcal{P}$ and a map $ρ$ from $\mathcal{P}$ to positive integers. The generating function $\mathfrak{F}_{\mathcal{P},ρ}$ of $(\mathcal{P},ρ)$-partitions is a polynomial that, when the images of $ρ$ tend to infinity, tends to Stanley's generating function $F_{\mathcal{P}}$ of $\mathcal{P}$-partitions. Analogous to Stanley's fundamental theorem for $\mathcal{P}$-partitions, we show that the set of $(\mathcal{P},ρ)$-partitions decomposes as a disjoint union of $(\mathcal{L},ρ)$-partitions where $\mathcal{L}$ runs over the set of linear extensions of $\mathcal{P}$. In this more general context, the set of all $\mathfrak{F}_{\mathcal{L},ρ}$ for linear orders $\mathcal{L}$ over determines a basis of polynomials. We thus introduce the notion of flagged $(\mathcal{P},ρ)$-partitions, and we prove that the set of all $\mathfrak{F}_{\mathcal{L},ρ}$ for flagged $(\mathcal{L},ρ)$-partitions for linear orders $\mathcal{L}$ is precisely the fundamental slide basis of the polynomial ring, introduced by the first author and Searles. Our main theorem shows that any generating function $\mathfrak{F}_{\mathcal{P},ρ}$ of flagged $(\mathcal{P},ρ)$-partitions is a positive integer linear combination of slide polynomials. As applications, we give a new proof of positivity of the slide product and, motivating our nomenclature, we also prove flagged Schur functions are slide positive.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sami Assaf, Nantel Bergeron. 2019-04-14. Flagged $(\mathcal{P},ρ)$-partitions. https://doi.org/10.1016/j.ejc.2020.103085

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