arXiv research

New method calculates bridge indices of spatial graphs using diagram colorings and Wirtinger number.

The paper refines Steinerberger curvature for block graphs and bridges.

Every cubic graph is a bridge trisection's 1-skeleton for a knotted surface.

First, we extend Otal's result for the trivial knot to trivial spatial graphs, namely, we show that for any bridge tangle decomposing sphere $S^2$ for a trivial spatial graph $Γ$, there exists a 2-sphere $F$ such that $F$ contains $Γ$ and $F$ intersects $S^2$ in a single loop. Next, we introduce two invariants for spat…

If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the complement of the graph bounds the graph distance of the bridge surface. We use this r…

We show that every knot is one crossing change away from a knot of arbitrarily high bridge number and arbitrarily high bridge distance.

Paper proves uniqueness of bridge multisections for surfaces in 4-space.

Let M be a compressionbody containing a graph T (with at least one edge) such that \boundary_+ M is parallel to the union of T and \boundary_- M. We extend methods of Hayashi and Shimokawa to classify bridge surfaces for T. The results of this paper are used in later work to show that if a bridge surface for a graph in…

Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel number of a composite genus 2 spatial graph. For the tunnel number of a composite …

We compute Cayley graphs and automorphism groups for all finite $n$-quandles of two-bridge and torus knots and links, as well as torus links with an axis.

Paper defines Farey Recursive Functions and explores their properties.

In this paper, we give an isotopy classification of 3-bridge spheres of 3-bridge arborescent links, which are not Montesinos links. To this end, we prove a certain refinement of a theorem of J.S. Birman and H.M. Hilden on the relation between bridge presentations of links and Heegaard splittings of 3-manifolds. In the …

The paper bridges spectral and spatial graph convolutions, improving model capacity and transferability.

We prove that links with meridional rank 3 whose 2-fold branched covers are graph manifolds are 3-bridge links. This gives a partial answer to a question by S. Cappell and J. Shaneson on the relation between the bridge numbers and meridional ranks of links. To prove this, we also show that the meridional rank of any sa…

Unified framework for OOD detection and generalization using graph theory.

We show that given a trivalent graph in $S^3$, either the graph complement contains an essential almost meridional planar surface or thin position for the graph is also bridge position. This can be viewed as an extension of a theorem of Thompson to graphs. It follows that any graph complement always contains a useful p…

GLAD improves latent graph generation by quantizing discrete latent space.

We prove a Reeb sphere theorem for finite simple graphs. The result bridges two different definitions of spheres in graph theory. We also reformulate Morse conditions in terms of the center manifolds, the level surface graphs {f=f(x)} in the unit sphere S(x). In the Morse case these graphs are either spheres, the empty…

Let $T$ be a graph in a compact, orientable 3--manifold $M$ and let $Γ$ be a subgraph. $T$ can be placed in bridge position with respect to a Heegaard surface $H$. We show that if $H$ is what we call $(T,Γ)$-c-weakly reducible in the complement of $T$ then either a "degenerate" situation occurs or $H$ can be untelescop…

Paper converts graph learning to lifelong learning.

Optimal coupling among random vectors with known statistics and correlation structure found using minimum spanning tree over measure-valued vertices.

We define two new families of invariants for (3-manifold, graph) pairs which detect the unknot and are additive under connected sum of pairs and (-1/2)-additive under trivalent vertex sum of pairs. The first of these families is closely related to both bridge number and tunnel number. The second of these families is a …

We discuss 3-manifolds which are cyclic coverings of the 3-sphere, branched over 2-bridge knots and links. Different descriptions of these manifolds are presented: polyhedral, Heegaard diagram, Dehn surgery and coloured graph constructions. Using these descriptions, we give presentations for their fundamental groups, w…

The bridge index and superbridge index of a knot are important invariants in knot theory. We define the bridge map of a knot conformation, which is closely related to these two invariants, and interpret it in terms of the tangent indicatrix of the knot conformation. Using the concepts of dual and derivative curves of s…

This study bridges the gap between spatial and spectral GNNs.

Residual torsion-free nilpotence has proven to be an important property for knot groups with applications to bi-orderability and ribbon concordance. Mayland proposed a strategy to show that a two-bridge knot group has a commutator subgroup which is a union of an ascending chain of parafree groups. This paper proves May…

We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by continued fractions, and it has recently been shown that one can associate to each con…

We propose a new graph kernel for graph classification and comparison using Ollivier Ricci curvature. The Ricci curvature of an edge in a graph describes the connectivity in the local neighborhood. An edge in a densely connected neighborhood has positive curvature and an edge serving as a local bridge has negative curv…

The study calculates average crosscap numbers for 2-bridge knots.

Method learns software resource usage from snapshots.

We introduce a new numerical knot invariant, termed the \textit{segment number}, which is derived from partitioned knot diagrams subject to specific over/under-crossing constraints. We prove that a knot is non-trivial if and only if its segment number is at least 3. Furthermore, we investigate the structural properties…

We prove for a large class of knots that the meridional rank coincides with the bridge number. This class contains all knots whose exterior is a graph manifold. This gives a partial answer to a question of S. Cappell and J. Shaneson, see problem 1.11 on Kirby's list.

Associated to every state surface for a knot or link is a state graph, which embeds as a spine of the state surface. A state graph can be decomposed along cut-vertices into graphs with induced planar embeddings. Associated with each such planar graph is a checkerboard surface, and each state surface is a fiber if and o…

We use the combinatorial techniques of graphs of intersection to study reducible Dehn surgeries on knots in the three-sphere. In particular, in the event that a reducible surgery on a knot K in the three-sphere of slope r produces a manifold with more than two connected summands, we show that r is bounded in absolute v…

We solve the isomorphism problem for the whole class of Lins-Mandel gems (graphs encoded manifolds). We also present certain homeomorphisms of branched cyclic coverings of two-bridge hyperbolic links. As a consequence, we prove that, in in a wide subset of interesting cases, the isomorphism conditions for Lins-Mandel g…

Extends Smale's principle to produce minimal graphs with singularities.

We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…

Graphons connect graph structures to manifold properties.

FKEE estimates expectations without samples, using diffusion bridges and PINNs.

Persistent homology enhances graph classification by capturing long-range graph properties.

The study improves genus 1 bridge number bounds for satellite knots.

We define a metric filtration of the Gordian graph by an infinite family of 1-dense subgraphs. The n-th subgraph of this family is generated by all knots whose fundamental groups surject to a symmetric group with parameter at least n, where all meridians are mapped to transpositions. Incidentally, we verify the Meridio…

Proposes TSBP for matching topological signal distributions.

A new neural network model for molecular graphs that learns efficiently and accurately.

To better understand the fundamental quandle of a knot or link, it can be useful to look at finite quotients of the quandle. One such quotient is the $n$-quandle (or, when $n=2$, the {\em involutory} quandle). Hoste and Shanahan \cite{HS2} gave a complete list of the links which have finite $n$-quandles; it remained to…

In this paper, we develop a novel Backtrackless Aligned-Spatial Graph Convolutional Network (BASGCN) model to learn effective features for graph classification. Our idea is to transform arbitrary-sized graphs into fixed-sized backtrackless aligned grid structures and define a new spatial graph convolution operation ass…

Tree Mover's Distance measures graph attributes and improves GNN performance.

BIG Laplacians bridge combinatorial and Hodge Laplacians for discrete data.