2,634 research outputs found

    Ramanujan Coverings of Graphs

    Full text link
    Let GG be a finite connected graph, and let ρ\rho be the spectral radius of its universal cover. For example, if GG is kk-regular then ρ=2kβˆ’1\rho=2\sqrt{k-1}. We show that for every rr, there is an rr-covering (a.k.a. an rr-lift) of GG where all the new eigenvalues are bounded from above by ρ\rho. It follows that a bipartite Ramanujan graph has a Ramanujan rr-covering for every rr. This generalizes the r=2r=2 case due to Marcus, Spielman and Srivastava (2013). Every rr-covering of GG corresponds to a labeling of the edges of GG by elements of the symmetric group SrS_{r}. 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 rr-th matching polynomial of GG to be the average matching polynomial of all rr-coverings of GG. We show this polynomial shares many properties with the original matching polynomial. For example, it is real rooted with all its roots inside [βˆ’Ο,ρ]\left[-\rho,\rho\right].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

    Full text link
    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

    Full text link
    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
    • …
    corecore