2000 character limit reached
On a representation of the automorphism group of a graph in a unimodular group
Published 8 Feb 2021 in math.CO, math.AG, and math.GR | (2102.04239v3)
Abstract: We investigate a representation of the automorphism group of a connected graph $X$ in the group of unimodular matrices $U_\beta$ of dimension $\beta$, where $\beta$ is the Betti number of graph $X$. We classify the graphs for which the automorphism group does not embed into $U_\beta$. It follows that if $X$ has no pendant vertices and $X$ is not a simple cycle, then the representation is faithful and $\mathrm{Aut}\,X$ acts faithfully on $H_1(X,\mathbb{Z})$. The latter statement can be viewed as a discrete analogue of a classical Hurwitz's theorem on Riemann surfaces of genera greater than one.
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.