Twin-free reduction conjecture for -free posets
Twin-free reduction conjecture for -free posets
Let be a -free poset, meaning that it contains no induced subposet isomorphic to the disjoint union of a -chain and a -chain. Call twin-free when there is no graph with a vertex such that , where is obtained by twinning at .
Twin-free reduction conjecture. If is -free and twin-free, then is -positive.
The source says that, if the preceding -free twinning conjecture is solved, the Stanley–Stembridge conjecture can be reduced to this conjecture. Its independent resolution status is not given.
Sources & referencesView supporting material
Primary source
Esther Banaian, Kyle Celano, Megan Chang-Lee, Laura Colmenarejo, Owen Goff, Jamie Kimble, Lauren Kimpel, John Lentfer, Jinting Liang and Sheila Sundaram, “The e-positivity of the chromatic symmetric function for twinned paths and cycles”, arXiv:2405.17649 (2024).
Additional references
2 papers in this index state this conjecture (2015–2024). The statement above is taken from the most recent of them; the others are arXiv:1504.06257.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.