Search arXivSearch

arXiv · 1701.02824

Schur P-positivity and involution Stanley symmetric functions

Abstract

The involution Stanley symmetric functions $\hat{F}_y$ are the stable limits of the analogues of Schubert polynomials for the orbits of the orthogonal group in the flag variety. These symmetric functions are also generating functions for involution words, and are indexed by the involutions in the symmetric group. By construction each $\hat{F}_y$ is a sum of Stanley symmetric functions and therefore Schur positive. We prove the stronger fact that these power series are Schur $P$-positive. We give an algorithm to efficiently compute the decomposition of $\hat{F}_y$ into Schur $P$-summands, and prove that this decomposition is triangular with respect to the dominance order on partitions. As an application, we derive pattern avoidance conditions which characterize the involution Stanley symmetric functions which are equal to Schur $P$-functions. We deduce as a corollary that the involution Stanley symmetric function of the reverse permutation is a Schur $P$-function indexed by a shifted staircase shape. These results lead to alternate proofs of theorems of Ardila-Serrano and DeWitt on skew Schur functions which are Schur $P$-functions. We also prove new Pfaffian formulas for certain related involution Schubert polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zachary Hamaker, Eric Marberg, Brendan Pawlowski. 2017-10-29. Schur P-positivity and involution Stanley symmetric functions. https://doi.org/10.1093/imrn%2Frnx274

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