ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Problem 3. 2. (N. Reading) Let W be a finite Coxeter group. In [41], Nathan Reading defines the notion of Coxeter-sortability for elements of W, relative to some Coxeter element

c.There are natural maps nc and cl from the Coxeter-sortable elements of W to the noncrossing partitions N C W, and to the set of clusters of type W, respectively. In [41], these maps are concretely defined, but the proof that they are bijections is case-by-case, using the fact that both objects are known to be counted by the Catalan number Cat( W ). (1) Give a uniform proof that the Coxeter-sorted elements are counted by Cat( W ). (2) Give a uniform proof that the map nc is well-defined. (3) Give a uniform proof that the maps nc and cl are bijections. (4) The notion of Coxeter-sortable elements, and the maps nc and cl can be defined for infinite type Coxeter groups. What happens in this case?

Record

Added
Links

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.