arXiv research

A {\em solvable} cover of a graph is a regular cover whose covering transformation group is solvable. In this paper, we show that a solvable cover of a graph can be decomposed into layers of abelian covers, and also, a lift of a given automorphism of the base graph of a solvable cover can be decomposed into layers of l…

The paper finds new graph covers with exceptionally low degree.

Generalizes Leighton's theorem to cube complexes.

We prove that the universal cover of any graph manifold quasi-isometrically embeds into a product of three trees. In particular we show that the Assouad-Nagata dimension of the universal cover of any closed graph manifold is 3, proving a conjecture of Smirnov.

We extend the notion of canonical measures to all (possibly non-compact) metric graphs. This will allow us to introduce a notion of "hyperbolic measures" on universal covers of metric graphs. Kazhdan's theorem for Riemann surfaces describes the limiting behavior of canonical (Arakelov) measures on finite covers in rela…

Optimizes cover parameter in Mapper algorithm for better visualization.

We introduce a topological invariant, it a type of a graph-manifold, which takes natural values. For a 4-dimensional graph-manifold, whose type does not exceed two, it is proved that its universal cover is bi-Lipschitz equivalent to a universal cover of an orthogonal graph-manifold (for any Riemannian metrics on graph-…

New graph invariant measures embeddability in 3D.

Let N be a regular branched cover of a homology 3-sphere M with deck group G isomorphic to Z_2^d and branch set a trivalent graph Gamma; such a cover is determined by a coloring of the edges of Gamma with elements of G. For each index-2 subgroup H of G, M_H = N/H is a double branched cover of M. Sakuma has proved that …

We investigate the geometry of the graphs of nonseparating curves for surfaces of finite positive genus with potentially infinitely many punctures. This graph has infinite diameter and is known to be Gromov hyperbolic by work of the author. We study finite covers between such surfaces and show that lifts of nonseparati…

Researchers calculate the volume of Seifert representations for graph manifolds and their covers.

Algorithm calculates genus of embedded graphs on surfaces.

Croke and Kleiner constructed two homeomorphic locally CAT(0) complexes whose universal covers have visual boundaries that are not homeomorphic. We construct two homeomorphic locally CAT(0) complexes so that the visual boundary of one universal cover contains a nonplanar graph, while the visual boundary of the other do…

We introduce the cluster exchange groupoid associated to a non-degenerate quiver with potential, as an enhancement of the cluster exchange graph. In the case that arises from an (unpunctured) marked surface, where the exchange graph is modelled on the graph of triangulations of the marked surface, we show that the univ…

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article turn the proof of this in to an algorithm to explicitly construct the universal abe…

It was shown in my earlier article that the splice diagram of a rational homology sphere graph manifold determines the manifolds universal abelian cover. In this article we use the proof of this to give a condition on the splice diagram to determine when the universal abelian cover itself is a rational homology sphere.

Random covers of hyperbolic surfaces follow a specific probability measure.

In this note we prove that any closed graph manifold admitting a metric of non-positive sectional curvature (NPC-metric) has a finite cover, which is fibered over the circle. An explicit criterion to have a finite cover, which is fibered over the circle, is presented for the graph manifolds of certain class.

Leighton's graph covering theorem states that a pair of finite graphs with isomorphic universal covers have a common finite cover. We provide a new proof of Leighton's theorem that allows generalizations; we prove the corresponding result for graphs with fins. As a corollary we obtain pattern rigidity for free groups w…

The covering spectrum is a geometric invariant of a Riemannian manifold, more generally of a metric space, that measures the size of its one-dimensional holes by isolating a portion of the length spectrum. In a previous paper we demonstrated that the covering spectrum is not a spectral invariant of a manifold in dimens…

A foliation of a manifold M is called R-covered if its lift to the universal cover of M has space of leaves R. We show that there are many graph manifolds which admit taut foliations, but which do not admit any R-covered foliations. On the other hand, we show that these manifolds all have finite covers admitting R-cove…

In this paper, we prove uniform lower bounds on the volume growth of balls in the universal covers of Riemannian surfaces and graphs. More precisely, there exists a constant $δ>0$ such that if $(M,hyp)$ is a closed hyperbolic surface and $h$ another metric on $M$ with $\area(M,h)\leq δ\area(M,hyp)$ then for every radiu…

Graphs indistinguishable by GNNs are fully characterized.

Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological space called the dimer space of the graph. This space turns out to be a cubed comp…

We show that, under weak assumptions, the automorphism group of a ${\rm CAT(0)}$ cube complex $X$ coincides with the automorphism group of Hagen's contact graph $\mathcal{C}(X)$. The result holds, in particular, for universal covers of Salvetti complexes, where it provides an analogue of Ivanov's theorem on curve graph…

We show that many 3-manifold groups have no nonabelian surface subgroups. For example, any link of an isolated complex surface singularity has this property. In fact, we determine the exact class of closed graph-manifolds which have no immersed pi_1-injective surface of negative Euler characteristic. We also determine …

Constructs graph manifolds with many Anosov flows.

Graph dynamics link combinatorics to geometry, revealing manifold intersections and stability.

New complex connects graph separability to group properties.

An oriented connected closed manifold $M^n$ is called a URC-manifold if for any oriented connected closed manifold $N^n$ of the same dimension there exists a nonzero degree mapping of a finite-fold covering $\widehat{M}^n$ of $M^n$ onto $N^n$. This condition is equivalent to the following: For any $n$-dimensional integ…

Consider a finite, regular cover $Y\to X$ of finite graphs, with associated deck group $G$. We relate the topology of the cover to the structure of $H_1(Y;\mathbb{C})$ as a $G$-representation. A central object in this study is the {\em primitive homology} group $H_1^{\mathrm{prim}}(Y;\mathbb{C})\subseteq H_1(Y;\mathbb{…

The paper explores subrepresentations in graph homology.

Unified framework for differentiable graph partitioning with probabilistic cuts.

This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.

Given a rational homology sphere M, whose splice diagram satisfy the semigroup condition, Neumann and Wahl were able to define a complete intersection surface singularity called splice diagram singularity from the splice diagram of M. They were also able to show that under an additional hypothesis on M called the congr…

To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. In this article we prove a sufficient numerical condition on the splice diagram for a graph manifold to be a singularity link. We also show that if two manifolds have the same splice diagram, then their unive…

We define some signature invariants for a class of knotted trivalent graphs using branched covers. We relate them to classical signatures of knots and links. Finally, we explain how to compute these invariants through the example of Kinoshita's knotted theta graph.

Let $f\colon M\to N$ be a continuous map between closed irreducible graph manifolds with infinite fundamental group. Perron and Shalen showed that if $f$ induces a homology equivalence on all finite covers, then $f$ is in fact homotopic to a homeomorphism. Their proof used the statement that every graph manifold is fin…

Develops algorithm for finite generating set of liftable mapping class groups of regular abelian covers.

A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched covering surface-knot, an addition of 1-handles equipped with cha…

Generalized Thurston's characterization for branched coverings of the 2-sphere.

A typical way in which network data is recorded is to measure all the interactions among a specified set of core nodes; this produces a graph containing this core together with a potentially larger set of fringe nodes that have links to the core. Interactions between pairs of nodes in the fringe, however, are not recor…

The d-invariant of an integral, positive definite lattice L records the minimal norm of a characteristic covector in each equivalence class mod 2L. We prove that the 2-isomorphism type of a connected graph is determined by the d-invariant of its lattice of integral cuts (or flows). As an application, we prove that a re…

A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot $F$, where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a graph called a chart on a surface diagram of $F$. We can simplify a branched cover…

Consider a finite connected graph possibly with multiple edges and loops. In discrete geometric analysis, Kotani and Sunada constructed the crystal associated to the graph as a standard realization of the maximal abelian covering of the graph. As an application of what the author showed in an earlier paper with Seshadr…

A construction of a spatial graph from a strongly invertible knot was developed by the second author, and a necessary and sufficient condition for the given spatial graph to be hyperbolic was provided as well. The condition is improved in this paper. This enable us to show that certain classes of knots can yield hyperb…

A method to describe Riemann surfaces using graph profiles is proposed.

Improved Mapper algorithm for datasets with varying density.