Injectivity conjecture for minimal infinite reduced words
Injectivity conjecture for minimal infinite reduced words
Let be an infinite reduced word, and let be its associated factorization map. Say that is minimal in its block when it is minimal in the relevant braid-equivalence block. Injectivity conjecture. If is an infinite reduced word which is minimal in its block, then is injective. The paper proves non-injectivity for words that are not minimal in their block, while the minimal case is presented as an open conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Thomas Lam and Pavlo Pylyavskyy, “Total positivity in loop groups II: Chevalley generators”, arXiv:0906.0610 (2009).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.