On plethysm conjectures of Stanley and Foulkes: the 2 × n case
Pavlo Pylyavskyy
Abstract
We prove Stanley's plethysm conjecture for the 2 × n case, which composed with the work of Black and List provides another proof of Foulkes conjecture for the 2 × n case. We also show that the way Stanley formulated his conjecture, it is false in general, and suggest an alternative formulation.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell