Strong sl₂-action versus symmetric chain decomposition conjecture
For every finite ranked poset , admits a strong -action if and only if admits a symmetric chain decomposition.
References
- Strong 𝔰𝔩₂ Actions and Symmetric Chain Decompositions — arXiv — Nate Harman, Rylan Rosas, Charles Troutman, Chris Wu
Source: arXiv
Progress summary
A new paper develops a promising framework and tests the conjecture extensively, but the central equivalence remains unproved.
The conjecture proposes an equivalence between a strong action and the existence of a symmetric chain decomposition. Nate Harman, Rylan Rosas, Charles Troutman, and Chris Wu introduce the framework and study its consequences.
October 2026 development
The authors report several special cases, weaker variants, and a large computational experiment supporting the proposed equivalence. These results constitute progress, but neither the general equivalence nor a complete resolution is established.
Current status (as of October 2026): The conjecture has new partial results and computational evidence, while the general equivalence remains open.
Sources
Solutions 0
No solutions have been posted yet.