Strong Actions and Symmetric Chain Decompositions
Nate Harman, Rylan Rosas, Charles Troutman, Chris Wu
Source abstract
We introduce a notion of a strong -action on a poset, and conjecture the existence of such an action is equivalent to the existence of a symmetric chain decomposition of that poset. We explain the intuition behind the conjecture, go through a number of explicit examples, and prove some special cases and relaxations of the conjecture. Then we explain a computational experiment where we tested the conjecture on millions of randomly constructed rank-symmetric, rank-unimodal, and strongly Sperner posets.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.