Snake-decomposition characterization of c-Cambrian order element posets
Statement
Let be a finite root system, let be a Coxeter element, and let denote the set of -posets. Let be the set of -Cambrian order element posets and the set of -Cambrian order interval posets. A -snake is a sequence of roots satisfying the alternating sign and order conditions described in the source, and a -snake decomposition of a root is an expression with and a -snake in the poset.
Snake-decomposition characterization. A -poset is in if and only if it is in and every root admits a -snake decomposition in .
This characterizes -Cambrian order element posets in terms of -Cambrian order interval posets and snake decompositions. It was proved in type and checked computationally for small Coxeter types; its general status is not resolved in the supplied source.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.