2000 character limit reached
    
  Polyhedral products, flag complexes and monodromy representations (1604.05504v3)
    Published 19 Apr 2016 in math.AT and math.GR
  
  Abstract: This article presents a machinery based on polyhedral products that produces faithful representations of graph products of finite groups and direct products of finite groups into automorphisms of free groups $\rm Aut(F_n)$ and outer automorphisms of free groups $\rm Out(F_n)$, respectively, as well as faithful representations of products of finite groups into the linear groups $\rm SL(n,\mathbb Z)$ and $\rm GL(n,\mathbb Z)$. These faithful representations are realized as monodromy representations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.