2 papers
math.CO2024
Correlation inequalities for linear extensions
Swee Hong Chan, Igor Pak
We employ the combinatorial atlas technology to prove new correlation inequalities for the number of linear extensions of finite posets. These include the approximate independence…
math.CO2024
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy
Christian Ikenmeyer, Igor Pak, Greta Panova
We prove that deciding the vanishing of the character of the symmetric group is -complete. We use this hardness result to prove that the the square of the character is not co…