The Ancestor Conjecture for finite Coxeter groups

Let WW be a Coxeter group with simple reflections RR, and let wWw\in W. A prefix of ww is an element uu for which some reduced expression for uu is an initial segment of a reduced expression for ww. Define the set of involution prefixes by

IP(w)={uW:u is a prefix of w and u2=1},\mathcal{IP}(w)=\{u\in W:u\text{ is a prefix of }w\text{ and }u^2=1\},

and define the set of ancestors by

A(w)={uIP(w):(u)=maxvIP(w)(v)}.A(w)=\{u\in\mathcal{IP}(w):\ell(u)=\max_{v\in\mathcal{IP}(w)}\ell(v)\}.

A non-identity element ww has the ancestor property when A(w)=1|A(w)|=1, and a Coxeter group has the ancestor property when every non-identity element does.

The Ancestor Conjecture. Every finite Coxeter group has the ancestor property.

Equivalently, every interval [1,w][1,w] in the weak left Bruhat order, for w1w\ne 1, contains a unique highest involution. The conjecture asserts the existence and uniqueness of a canonical maximal-length involution prefix for every non-identity element; its resolution is not supplied in the source.

Sources & referencesView supporting material

Primary source

Sarah B. Hart and Peter J. Rowley, “A note on involution prefixes in Coxeter groups”, arXiv:2502.00777 (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.