arXiv subjects
Publications and source records attributed to Pavlo Pylyavskyy.
The second author has introduced non-crossing tableaux, objects whose non-nesting analogues are semi-standard Young tableaux. We relate non-crossing tableaux to Gelfand-Tsetlin patterns and develop the non-crossing analogue of standard monomial theory. Leclerc and Zelevinsky's weakly separated sets are special cases of non-crossing tableaux, and we suggest that non-crossing tableaux may help illuminate the theory of weakly separated sets.
We introduce the notion of the descent set polynomial as an alternative way of encoding the sizes of descent classes of permutations. Descent set polynomials exhibit interesting factorization patterns. We explore the question of when particular cyclotomic factors divide these polynomials. As an instance we deduce that the proportion of odd entries in the descent set statistics in the symmetric group S_n only depends on the number on 1's in the binary expansion of n. We observe similar properties for the signed descent set statistics.
We show that Schützenberger's promotion on two and three row rectangular Young tableaux can be realized as cyclic rotation of certain planar graphs introduced by Kuperberg. Moreover, following work of the third author, we show that this action admits the cyclic sieving phenomenon.
We describe the rank 3 Temperley-Lieb-Martin algebras in terms of Kuperberg's A_2-webs. We define consistent labelings of webs, and use them to describe the coefficients of decompositions into irreducible webs. We introduce web immanants, inspired by Temperley-Lieb immanants of Rhoades and Skandera. We show that web immanants are positive when evaluated on totally positive matrices, and describe some further properties.
Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, we study six combinatorial Hopf algebras. These Hopf algebras can be thought of as K-theoretic analogues of the by now classical ``square'' of Hopf algebras consisting of symmetric functions, quasisymmetric functions, noncommutative symmetric functions and the Malvenuto-Reutenauer Hopf algebra of permutations. In addition, we develop a theory of set-valued P-partitions and study three new families of symmetric functions which are weight generating functions of reverse plane partitions, weak set-valued tableaux and valued-set tableaux.
We study pfaffian analogues of immanants, which we call pfaffinants. Our main object is the TL-pfaffinants which are analogues of Rhoades and Skandera's TL-immanants. We show that TL-pfaffinants are positive when applied to planar networks and explain how to decompose products of complementary pfaffians in terms of TL-pfaffinants. We conjecture in addition that TL-pfaffinants have positivity properties related to Schur Q-functions.
We give combinatorial proofs that certain families of differences of products of Schur functions are monomial-positive. We show in addition that such monomial-positivity is to be expected of a large class of generating functions with combinatorial definitions similar to Schur functions. These generating functions are defined on posets with labelled Hasse diagrams and include for example generating functions of Stanley's $(P,ω)$-partitions.
We show that certain differences of products of $P$-partition generating functions are positive in the basis of fundamental quasi-symmetric functions L_α. This result interpolates between recent Schur positivity and monomial positivity results of the same flavor. We study the case of chains in detail, introducing certain ``cell transfer'' operations on compositions and an interesting related ``L-positivity'' poset. We introduce and study quasi-symmetric functions called ``wave Schur functions'' and use them to establish, in the case of chains, that the difference of products we study is itself equal to a single generating function K_{P,θ} for a labeled poset (P,θ). In the course of our investigations we establish some factorization properties of the ring of quasisymmetric functions.
Let $λ$, $μ$, $ν$ and $ρ$ be dominant weights of $\mathfrak{sl_n}$ satisfying $λ+ μ= ν+ ρ$. Let $V_λ$ denote the highest weight module corresponding to $λ$. Lam, Postnikov, Pylyavskyy conjectured a sufficient condition for $V_λ \otimes V_μ$ to be contained in $V_ν \otimes V_ρ$ as $\mathfrak{sl_n}$-modules. In this note we prove a weaker version of the conjecture. Namely we prove that under the conjectured conditions every irreducible $\mathfrak{sl_n}$-module which appears in the decomposition of $V_λ \otimes V_μ$ does appear in the decomposition of $V_ν \otimes V_ρ$.
In combinatorics there is a well-known duality between non-nesting and non-crossing objects. In algebra there are many objects which are standard, for example Standard Young Tableaux, Standard Monomials, Standard Bitableaux. We adopt a point of view that these standard objects are really non-nesting, and we find their non-crossing counterparts.
We prove Okounkov's conjecture, a conjecture of Fomin-Fulton-Li-Poon, and a special case of Lascoux-Leclerc-Thibon's conjecture on Schur positivity and give several more general statements using a recent result of Rhoades and Skandera. An alternative proof of this result is provided. We also give an intriguing log-concavity property of Schur functions.
For a directed graph G on vertices {0,1,...,n}, a G-parking function is an n-tuple (b_1,...,b_n) of non-negative integers such that, for every non-empty subset U of {1,...,n}, there exists a vertex j in U for which there are more than b_j edges going from j to G-U. We construct a family of bijective maps between the set P_G of G-parking functions and the set T_G of spanning trees of G rooted at 0, thus providing a combinatorial proof of |P_G| = |T_G|.
We prove Stanley's plethysm conjecture for the $2 \times n$ case, which composed with the work of Black and List provides another proof of Foulkes conjecture for the $2 \times n$ case. We also show that the way Stanley formulated his conjecture, it is false in general, and suggest an alternative formulation.