Searcharxiv⌕ Search

arXiv subjects

Maggy Tomova

Publications and source records attributed to Maggy Tomova.

At least 19 recordsLinked to original sources
arXiv2025

The genus 1 bridge number of satellite knots

Let $T$ be a satellite knot, link, or spatial graph in a 3-manifold $M$ that is either $S^3$ or a lens space. Let $\mathfrak{b}_0$ and $\mathfrak{b}_1$ denote genus 0 and genus 1 bridge number, respectively. Suppose that $T$ has a companion knot $K$ (necessarily not the unknot) and wrapping number $ω$ with respect to $K$. When $K$ is not a torus knot, we show that $\mathfrak{b}_1(T)\geq ω\mathfrak{b}_1(K)$. There are previously known counter-examples if $K$ is a torus knot. Along the way, we generalize and give a new proof of Schubert's result that $\mathfrak{b}_0(T) \geq ω\mathfrak{b}_0(K)$. We also prove versions of the theorem applicable to when $T$ is a ``lensed satellite'' and when there is a torus separating components of $T$.

math.GT↗
arXiv2021

Kirby-Thompson distance for trisections of knotted surfaces

We adapt work of Kirby-Thompson and Zupan to define an integer invariant $\mathcal{L}(\mathcal{T})$ of a bridge trisection $\mathcal{T}$ of a smooth surface $\mathcal{K}$ in $S^4$ or $B^4$. We show that when $\mathcal{L}(\mathcal{T})=0$, then the surface $\mathcal{K}$ is unknotted. We also show show that for a trisection $\mathcal{T}$ of an irreducible surface, bridge number produces a lower bound for $\mathcal{L}(\mathcal{T})$. Consequently, $\mathcal{L}$ can be arbitrarily large.

math.GT↗
arXiv2021

Tunnel number and bridge number of composite genus 2 spatial graphs

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 Brunnian $θ$-curve, our result implies that the tunnel number is at least the number of summands, as in the knot case. We also prove a version of a theorem of Morimoto for knots: the tunnel number of a composite m-small genus 2 spatial graph is at least the sum of the tunnel numbers of the factors. We also study lower bounds for the bridge number of composite genus 2 graphs. In particular, our results imply that for a Brunnian composite $θ$-curve having $m$ factors in its prime factorization, the bridge number is at least $m+3/2$.

math.GT↗
arXiv2020

The relative $\mathcal{L}$-invariant of a compact $4$-manifold

In this paper, we introduce the relative $\mathcal{L}$-invariant $r\mathcal{L}(X)$ of a smooth, orientable, compact 4-manifold $X$ with boundary. This invariant is defined by measuring the lengths of certain paths in the cut complex of a trisection surface for $X$. This is motivated by the definition of the $\mathcal{L}$-invariant for smooth, orientable, closed 4-manifolds by Kirby and Thompson. We show that if $X$ is a rational homology ball, then $r\mathcal{L}(X)=0$ if and only if $X\cong B^4$. In order to better understand relative trisections, we also produce an algorithm to glue two relatively trisected 4-manifold by any Murasugi sum or plumbing in the boundary, and also prove that any two relative trisections of a given 4-manifold $X$ are related by interior stabilization, relative stabilization, and the relative double twist, which we introduce in this paper as a trisection version of one of Piergallini and Zuddas's moves on open book decompositions. Previously, it was only known (by Gay and Kirby) that relative trisections inducing equivalent open books on $X$ are related by interior stabilizations.

math.GT↗
arXiv2019

Distortion and the bridge distance of knots

We extend techniques due to Pardon to show that there is a lower bound on the distortion of a knot in $\mathbb{R}^3$ proportional to the minimum of the bridge distance and the bridge number of the knot. We also exhibit an infinite family of knots for which the minimum of the bridge distance and the bridge number is unbounded and Pardon's lower bound is constant.

math.GT↗
arXiv2018

Thin position for knots, links, and graphs in 3-manifolds

We define a new notion of thin position for a graph in a 3-manifold which combines the ideas of thin position for manifolds first originated by Scharlemann and Thompson with the idea of thin position for knots first originated by Gabai. This thin position has the property that connect summing annuli and pairs-of-pants show up as thin levels. In a forthcoming paper, this new thin position allows us to define two new families of invariants of knots, links, and graphs in 3-manifolds. The invariants in one family are similar to bridge number and the invariants in the other family are similar to Gabai's width for knots in the 3-sphere. The invariants in both families detect the unknot and are additive under connected sum and trivalent vertex sum.

math.GT↗
arXiv2018

Additive invariants for knots, links and graphs in 3-manifolds

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 variation and generalization of Gabai's width for knots in the 3-sphere. We give applications to the tunnel number and higher genus bridge number of connected sums of knots.

math.GT↗
arXiv2016

Exceptional and cosmetic surgeries on knots

We show that the distance of a link $K$ with respect to a bridge surface of any genus determines a lower bound on the genus of essential surfaces and Heegaard surfaces in the manifolds that result from non-trivial Dehn surgeries on the knot. In particular, knots with high bridge distance do not admit non-trivial non-hyperbolic surgeries or non-trivial cosmetic surgeries. We further show that if a knot has bridge distance at least 3 then its bridge number is bounded above by a function of Seifert genus, or indeed by the genus of (almost) any essential surface or Heegaard surface in the surgered manifold.

math.GT↗
arXiv2014

Essential surfaces in highly twisted link complements

We prove that in the complement of a highly twisted link, all closed, essential, meridionally incompressible surfaces must have high genus. The genus bound is proportional to the number of crossings per twist region. A similar result holds for surfaces with meridional boundary: such a surface either has large negative Euler characteristic, or is an n-punctured sphere visible in the diagram.

math.GT↗
arXiv2013

Distance Two Links

In this paper, we characterize all links in the 3-sphere with bridge number at least three that have a bridge sphere of distance two. We show that a link L has a bridge sphere of distance at most two then it falls into at least one of three categories: (1) The exterior of L contains an essential meridional sphere. (2) L can be decomposed as a tangle product of a Montesinos tangle with an essential tangle in a way that respects the bridge surface and either the Montesinos tangle is rational or the essential tangle contains an incompressible, boundary-incompressible annulus. (3) L is obtained by banding from another link L' that has a bridge sphere of the same Euler characteristic as the bridge sphere for L but of distance 0 or 1.

math.GT↗
arXiv2013

High Distance Bridge Surfaces

Given integers b, c, g, and n, we construct a manifold M containing a c-component link L so that there is a bridge surface Sigma for (M,L) of genus g that intersects L in 2b points and has distance at least n. More generally, given two possibly disconnected surfaces S and S', each with some even number (possibly zero) of marked points, and integers b, c, g, and n, we construct a compact, orientable manifold M with boundary S \cup S' such that M contains a c-component tangle T with a bridge surface Sigma of genus g that separates the boundary of M into S and S', |T \cap Sigma|=2b and T intersects S and S' exactly in their marked points, and Sigma has distance at least n.

math.GT↗
arXiv2012

Genus bounds bridge number for high distance knots

If a knot K in a closed, orientable 3-manifold M has a bridge surface T with distance at least 3 in the curve complex of T - K, then the genus of any essential surface in its exterior with non-empty, non-meridional boundary gives rise to an upper bound for the bridge number of K with respect to T. In particular, a nontrivial, aspherical, and atoroidal knot K with such a bridge surface has its bridge number bounded by 5 if K has a non-trivial reducing surgery; 6 if K has a non-trivial toroidal surgery; and 4g + 2 if K is null-homologous and has Seifert genus g.

math.GT↗
arXiv2012

C-essential surfaces in (3-manifold, graph) pairs

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 untelescoped and consolidated into a collection of "thick surfaces" and "thin surfaces". The thin surfaces are c-essential (c-incompressible and essential) in the graph exterior and each thick surface is a strongly irreducible bridge surface in the complement of the thin surfaces. This strengthens and extends previous results of Hayashi-Shimokawa and Tomova to graphs in 3-manifolds that may have non-empty boundary.

math.GT↗
arXiv2012

The Radio numbers of all graphs of order $n$ and diameter $n-2$

A radio labeling of a connected graph $G$ is a function $c:V(G) \to \mathbb Z_+$ such that for every two distinct vertices $u$ and $v$ of $G$ $$\text{distance}(u,v)+|c(u)-c(v)|\geq 1+ \text{diameter}(G).$$ The radio number of a graph $G$ is the smallest integer $M$ for which there exists a labeling $c$ with $c(v)\leq M$ for all $v\in V(G)$. The radio number of graphs of order $n$ and diameter $n-1$, i.e., paths, was determined in \cite{paths}. Here we determine the radio numbers of all graphs of order $n$ and diameter $n-2$.

math.CO↗
arXiv2010

The Radio Number of $C_n \square C_n$

Radio labeling is a variation of Hale's channel assignment problem, in which one seeks to assign positive integers to the vertices of a graph $G$ subject to certain constraints involving the distances between the vertices. Specifically, a radio labeling of a connected graph $G$ is a function $c:V(G) \rightarrow \mathbb Z_+$ such that $$d(u,v)+|c(u)-c(v)|\geq 1+\text{diam}(G)$$ for every two distinct vertices $u$ and $v$ of $G$ (where $d(u,v)$ is the distance between $u$ and $v$). The span of a radio labeling is the maximum integer assigned to a vertex. The radio number of a graph $G$ is the minimum span, taken over all radio labelings of $G$. This paper establishes the radio number of the Cartesian product of a cycle graph with itself (i.e., of $C_n\square C_n$.)

math.CO↗
arXiv2010

Radio numbers for generalized prism graphs

A radio labeling is an assignment $c:V(G) \rightarrow \textbf{N}$ such that every distinct pair of vertices $u,v$ satisfies the inequality $d(u,v)+|c(u)-c(v)|\geq \diam(G)+1$. The span of a radio labeling is the maximum value. The radio number of $G$, $rn(G)$, is the minimum span over all radio labelings of $G$. Generalized prism graphs, denoted $Z_{n,s}$, $s \geq 1$, $n\geq s$, have vertex set $\{(i,j)\,|\, i=1,2 \text{and} j=1,...,n\}$ and edge set $\{((i,j),(i,j \pm 1))\} \cup \{((1,i),(2,i+σ))\,|\,σ=-\left\lfloor\frac{s-1}{2}\right\rfloor\,\ldots,0,\ldots,\left\lfloor\frac{s}{2}\right\rfloor\}$. In this paper we determine the radio number of $Z_{n,s}$ for $s=1,2$ and $3$. In the process we develop techniques that are likely to be of use in determining radio numbers of other families of graphs.

math.CO↗