Weak modularity of the 1-skeleta of A_n buildings

Let a building of type A~n\widetilde{A}_n be a simplicial complex built from Coxeter complexes of type A~n\widetilde{A}_n, and let its 1-skeleton be the graph whose vertices and edges are those of the building. A graph is weakly modular if it satisfies the triangle and quadrangle conditions. Weak modularity conjecture for A~n\widetilde{A}_n buildings. The 1-skeleta of buildings of type A~n\widetilde{A}_n are weakly modular. The result is proved in the source for buildings of type A~3\widetilde{A}_3; the conjecture asserts that the same conclusion holds for every nn, although it is unclear whether the given proof generalizes or whether different techniques are required.

Sources & referencesView supporting material

Primary source

Zachary Munro, “Weak Modularity and A_n Buildings”, arXiv:1906.10259 (2019).

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.