2,634 research outputs found
Ramanujan Coverings of Graphs
Let be a finite connected graph, and let be the spectral radius of
its universal cover. For example, if is -regular then
. We show that for every , there is an -covering
(a.k.a. an -lift) of where all the new eigenvalues are bounded from
above by . It follows that a bipartite Ramanujan graph has a Ramanujan
-covering for every . This generalizes the case due to Marcus,
Spielman and Srivastava (2013).
Every -covering of corresponds to a labeling of the edges of by
elements of the symmetric group . We generalize this notion to labeling
the edges by elements of various groups and present a broader scenario where
Ramanujan coverings are guaranteed to exist.
In particular, this shows the existence of richer families of bipartite
Ramanujan graphs than was known before. Inspired by Marcus-Spielman-Srivastava,
a crucial component of our proof is the existence of interlacing families of
polynomials for complex reflection groups. The core argument of this component
is taken from a recent paper of them (2015).
Another important ingredient of our proof is a new generalization of the
matching polynomial of a graph. We define the -th matching polynomial of
to be the average matching polynomial of all -coverings of . We show this
polynomial shares many properties with the original matching polynomial. For
example, it is real rooted with all its roots inside .Comment: 38 pages, 4 figures, journal version (minor changes from previous
arXiv version). Shortened version appeared in STOC 201
Graphs, free groups and the Hanna Neumann conjecture
A new bound for the rank of the intersection of finitely generated subgroups
of a free group is given, formulated in topological terms, and very much in the
spirit of Stallings. The bound is a contribution to (although unfortunately not
a solution of) the strengthened Hanna Neumann conjecture.Comment: J. Group Theory (to appear
Branched Coverings, Triangulations, and 3-Manifolds
A canonical branched covering over each sufficiently good simplicial complex
is constructed. Its structure depends on the combinatorial type of the complex.
In this way, each closed orientable 3-manifold arises as a branched covering
over the 3-sphere from some triangulation of S^3. This result is related to a
theorem of Hilden and Montesinos. The branched coverings introduced admit a
rich theory in which the group of projectivities plays a central role.Comment: v2: several changes to the text body; minor correction
- β¦