Search arXivSearch

arXiv · 2107.07428

Subrepresentations in the homology of finite covers of graphs

Abstract

Let $p \colon Y \to X$ be a finite, regular cover of finite graphs with associated deck group $G$, and consider the first homology $H_1(Y;\mathbb{C})$ of the cover as a $G$-representation. The main contribution of this article is to broaden the correspondence and dictionary between the representation theory of the deck group $G$ on the one hand, and topological properties of homology classes in $H_1(Y;\mathbb{C})$ on the other hand. We do so by studying certain subrepresentations in the $G$-representation $H_1(Y;\mathbb{C})$. The homology class of a lift of a primitive element in $π_1(X)$ spans an induced subrepresentation in $H_1(Y;\mathbb{C})$, and we show that this property is never sufficient to characterize such homology classes if $G$ is Abelian. We study $H_1^{\textrm{comm}}(Y;\mathbb{C}) \leq H_1(Y;\mathbb{C})$ -- the subrepresentation spanned by homology classes of lifts of commutators of primitive elements in $π_1(X)$. Concretely, we prove that the span of such a homology class is isomorphic to the quotient of two induced representations. Furthermore, we construct examples of finite covers with $H_1^{\textrm{comm}}(Y;\mathbb{C}) \neq \ker(p_*)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xenia Flamm. 2023-12-02. Subrepresentations in the homology of finite covers of graphs. https://doi.org/10.1017/s0017089523000150

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Burau representation of the braid group is faithful for n = 4

In this paper we use ideas introduced earlier by Moody, Long, Long-Paton, and Bigelow to prove the theorem of the title, that the Burau representation of the classical braid group is faithful for n = 4. An immediate corollary is that the Jones representation of the braid group is also faithful for n = 4.

math.GT

The Lorenz braid index and hyperbolic volume

A result of Futer, Kalfagianni, and Purcell implies that an upper volume bound for all link complements in the 3-sphere cannot depend solely on the braid index. In this paper, we introduce the Lorenz braid index and generalise the bunch algorithm to provide a general upper volume bound for all link complements in the 3-sphere. Such an upper bound is a quadratic polynomial in the Lorenz braid index. In addition, we construct an explicit family of hyperbolic Lorenz knots for which the classical braid index and the Seifert genus both tend to infinity, while the Lorenz braid index remains bounded.

math.GT