ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Φ\Phi be a finite root system, let cc be a Coxeter element, and let P(Φ)\mathcal{P}(\Phi) denote the set of Φ\Phi-posets. Let COEP(c)\mathsf{COEP}(c) be the set of cc-Cambrian order element posets and COIP(c)\mathsf{COIP}(c) the set of cc-Cambrian order interval posets. A cc-snake is a sequence of roots satisfying the alternating sign and order conditions described in the source, and a cc-snake decomposition of a root α\alpha is an expression α=∑i∈[p]λiαi\alpha=\sum_{i\in[p]}\lambda_i\alpha_i with λi∈N\lambda_i\in\mathbb{N} and α1,…,αp\alpha_1,\ldots,\alpha_p a cc-snake in the poset.

Snake-decomposition characterization. A Φ\Phi-poset \rel∈P(Φ)\mathrel{\mathop{\rel}}\in\mathcal{P}(\Phi) is in COEP(c)\mathsf{COEP}(c) if and only if it is in COIP(c)\mathsf{COIP}(c) and every root α∈Φ\alpha\in\Phi admits a cc-snake decomposition in \rel\mathrel{\mathop{\rel}}.

This characterizes cc-Cambrian order element posets in terms of cc-Cambrian order interval posets and snake decompositions. It was proved in type AA 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.