Finite word-width conjecture for irreducible lattices
Statement
Let be a finite set of places, let be a semisimple group over the corresponding local factors, let
be an irreducible lattice in
and let be a word in the free group on generators. The width of in is the least number of values of and their inverses needed to express every element of the verbal subgroup generated by those values, when such a bound exists. Finite word-width conjecture. The width of in is finite if and only if
The conjecture seeks a uniform distinction between higher-rank and rank-one irreducible lattices through widths of words. The source notes that finite word-width questions are extensively studied, but that no non-silly word and higher-rank uniform lattice was then known for which finiteness or infinitude of the width was established.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.