5 citations · 7 across the 5 of their papers we have counts for
6 papers · 1 filter
A non-crossing standard monomial theory
T. Kyle Petersen, Pavlo Pylyavskyy, David E Speyer
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 pat…
Promotion and cyclic sieving via webs
T. Kyle Petersen, Pavlo Pylyavskyy, Brendon Rhoades
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. Moreove…
Combinatorial Hopf algebras and K-homology of Grassmanians
Thomas Lam, Pavlo Pylyavskyy
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…
Temperley-Lieb pfaffinants and Schur -positivity conjectures
Thomas Lam, Pavlo Pylyavskyy
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…
On plethysm conjectures of Stanley and Foulkes: the case
Pavlo Pylyavskyy
We prove Stanley's plethysm conjecture for the case, which composed with the work of Black and List provides another proof of Foulkes conjecture for the c…
A family of bijections between G-parking functions and spanning trees
Denis Chebikin, Pavlo Pylyavskyy
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}, ther…