5 citations · 5 across the 2 of their papers we have counts for
2 papers
math.CO2004
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…
math.CO2003★ 5 cited
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…