Papers
Topics
Authors
Recent
Search
2000 character limit reached

On regular CAT(0) cube complexes

Published 1 Nov 2014 in math.GR | (1411.0178v1)

Abstract: We provide a necessary and sufficient condition on a finite flag simplicial complex, L, for which there exists a unique CAT(0) cube complex whose vertex links are all isomorphic to L. We then find new examples of such CAT(0) cube complexes and prove that their automorphism groups are virtually simple. The latter uses a result, which we prove in the appendix, about the simplicity of certain subgroups of the automorphism group of a rank-one CAT(0) cube complex. This result generalizes previous results by Tits and by Haglund and Paulin.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.