Alternating subword complex equivalence conjecture

About 3 years old · traced to

Let QQ be a word in the simple generators of a finite Coxeter group, let ω\omega be a Coxeter-group element, and let [e,ω][e,\omega] be the corresponding interval in the weak order. Suppose that QQ is alternating, meaning that every pair of non-commuting generators s,ts,t alternates within QQ. The subword complex equivalence relation ≡Q,ω\equiv_{Q,\omega} on [e,ω][e,\omega] is defined by restricting the partition into sets of linear extensions to this interval. Alternating subword complex equivalence conjecture. If QQ is alternating, then ≡Q,ω\equiv_{Q,\omega} is a lattice congruence of the interval [e,ω][e,\omega] of the weak order. This would identify the equivalence induced by alternating subword complexes with a lattice-theoretic quotient of the weak-order interval. The supplied text does not indicate whether the assertion has been proved or remains open.

References

Primary source

Nantel Bergeron, Noémie Cartier, Cesar Ceballos and Vincent Pilaud, “Lattices of acyclic pipe dreams”, arXiv:2303.11025 (2025).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.