17 citations · 47 across the 16 of their papers we have counts for
4 papers · 1 filter
Computational Complexity in Algebraic Combinatorics
Greta Panova
Algebraic Combinatorics originated in Algebra and Representation Theory, studying their discrete objects and integral quantities via combinatorial methods which have since develope…
On the cross-product conjecture for the number of linear extensions
Swee Hong Chan, Igor Pak, Greta Panova
We prove a weak version of the cross--product conjecture: , where is the number of…
All Kronecker coefficients are reduced Kronecker coefficients
Christian Ikenmeyer, Greta Panova
We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kr…
Complexity and asymptotics of structure constants
Greta Panova
Kostka, Littlewood-Richardson, Kronecker, and plethysm coefficients are fundamental quantities in algebraic combinatorics, yet many natural questions about them stay unanswered for…