Papers
Topics
Authors
Recent
Search
2000 character limit reached

Graph coverings and (im)primitive homology: some new examples of exceptionally low degree

Published 31 Aug 2020 in math.GT and math.GR | (2008.13714v1)

Abstract: Given a finite covering of graphs $f : Y \to X$, it is not always the case that $H_1(Y;\mathbb{C})$ is spanned by lifts of primitive elements of $\pi_1(X)$. In this paper, we study graphs for which this is not the case, and we give here the simplest known nontrivial examples of covers with this property, with covering degree as small as 128. Our first step is focusing our attention on the special class of graph covers where the deck group is a finite $p$-group. For such covers, there is a representation-theoretic criterion for identifying deck groups for which there exist covers with the property. We present an algorithm for determining if a finite $p$-group satisfies this criterion that uses only the character table of the group. Finally, we provide a complete census of all finite $p$-groups of rank $\geq 3$ and order $< 1000$ satisfying this criterion, all of which are new examples.

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.

Collections

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