加载中…
We show that every finite premaniplex of rank or is the symmetry type graph of a finite maniplex, settling the finite rank and case of the maniplex version of the symmetry type graph problem. The proof uses the fact that the universal string Coxeter groups of rank and are amalgams (of finite groups), hence they act on a tree, which allows us to use a lifting theorem of Potočnik and Spiga.

生成讲解博客的中文版本

生成AI智能校验的中文版本