The diameter-three conjecture for small Weyl graphs
The diameter-three conjecture for small Weyl graphs
Let be an irreducible classical root system of rank at least , and let be its small Weyl graph. The diameter of a graph is the maximum distance between two of its vertices. Diameter-three conjecture. The diameter of is at most . This is suggested by computations for several root systems, in which the diameter was always at most ; the general case remains open.
Sources & referencesView supporting material
Primary source
Mikhail Ershov, Andrei Jaikin-Zapirain and Martin Kassabov, “Property (T) for groups graded by root systems”, arXiv:1102.0031 (2014).
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
Sign in to submit a solution.
No solutions have been posted yet.