Searcharxiv⌕ Search

arXiv subjects

Thomas W. Mattman

Publications and source records attributed to Thomas W. Mattman.

At least 37 records · Page 2Linked to original sources
arXiv2016

Six variations on a theme: almost planar graphs

A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that $G/e$ is planar, as well as the analogues with a universal quantifier: $\forall v$, $G-v$ planar; $\forall e$, $G-e$ planar; and $\forall e$, $G/e$ planar. The Graph Minor Theorem of Robertson and Seymour ensures that each of these six gives rise to a finite set of obstruction graphs. For the three definitions with universal quantifiers we determine this set. For the remaining properties, apex, edge apex, and contraction apex, we show there are at least 36, 55, and 82 obstruction graphs respectively. We give two similar approaches to almost nonplanar ($\exists e$, $G+e$ is nonplanar and $\forall e$, $G+e$ is nonplanar) and determine the corresponding minor minimal graphs.

math.CO↗
arXiv2016

Order nine MMIK graphs

We show that there are exactly eight MMIK (minor minimal intrinsically knotted) graphs of order nine.

math.CO↗
arXiv2015

Graphs on 21 edges that are not 2--apex

We show that the 20 graph Heawood family, obtained by a combination of triangle-Y and Y-triangle moves on $K_7$, is precisely the set of graphs of at most 21 edges that are minor minimal for the property not $2$--apex. As a corollary, this gives a new proof that the 14 graphs obtained by triangle-Y moves on $K_7$ are the minor minimal intrinsically knotted graphs of 21 or fewer edges. Similarly, we argue that the seven graph Petersen family, obtained from $K_6$, is the set of graphs of at most 17 edges that are minor minimal for the property not apex.

math.CO↗
arXiv2013

Intrinsically knotted graphs with 21 edges

We show that the 14 graphs obtained by $\nabla\mathrm{Y}$ moves on K_7 constitute a complete list of the minor minimal intrinsically knotted graphs on 21 edges. We also present evidence in support of a conjecture that the 20 graph Heawood family, obtained by a combination of $\nabla\mathrm{Y}$ and $\mathrm{Y}\nabla$ moves on K_7, is the list of graphs of size 21 that are minor minimal with respect to the property not 2--apex.

math.GT↗
arXiv2011

Tangle sums and factorization of A-polynomials

We show that there exist infinitely many examples of pairs of knots, K_1 and K_2, that have no epimorphism $π_1(S^3\setminus K_1) \to π_1(S^3\setminus K_2)$ preserving peripheral structure although their A-polynomials have the factorization $A_{K_2}(L,M) \mid A_{K_1}(L,M)$. Our construction accounts for most of the known factorizations of this form for knots with 10 or fewer crossings. In particular, we conclude that while an epimorphism will lead to a factorization of A-polynomials, the converse generally fails.

math.GT↗
arXiv2011

The $A$-polynomial of the $(-2,3,3+2n)$ pretzel knots

We show that the A-polynomial $A_n$ of the 1-parameter family of pretzel knots $K_n=(-2,3,3+2n)$ satisfies a linear recursion relation of order 4 with explicit constant coefficients and initial conditions. Our proof combines results of Tamura-Yokota and the second author. As a corollary, we show that the $A$-polynomial of $K_n$ and the mirror of $K_{-n}$ are related by an explicit $\GL(2,\BZ)$ action. We leave open the question of whether or not this action lifts to the quantum level.

math.GT↗
arXiv2009

Graphs of 20 edges are 2-apex, hence unknotted

A graph is 2-apex if it is planar after the deletion of at most two vertices. Such graphs are not intrinsically knotted, IK. We investigate the converse, does not IK imply 2-apex? We determine the simplest possible counterexample, a graph on nine vertices and 21 edges that is neither IK nor 2-apex. In the process, we show that every graph of 20 or fewer edges is 2-apex. This provides a new proof that an IK graph must have at least 21 edges. We also classify IK graphs on nine vertices and 21 edges and find no new examples of minor minimal IK graphs in this set.

math.GT↗
arXiv2009

A proof of the Kauffman-Harary Conjecture

We prove the Kauffman-Harary Conjecture, posed in 1999: given a reduced, alternating diagram D of a knot with prime determinant p, every non-trivial Fox p-coloring of D will assign different colors to different arcs.

math.GT↗
arXiv2008

On the Harary-Kauffman Conjecture and Turk's Head Knots

The m,n Turk's Head Knot, THK(m,n), is an "alternating (m,n) torus knot." We prove the Harary-Kauffman conjecture for all THK(m,n) except for the case where m \geq 5 is odd and n \geq 3 is relatively prime to m. We also give evidence in support of the conjecture in that case. Our proof rests on the observation that none of these knots have prime determinant except for THK(m,2) when P_m is a Pell prime.

math.GT↗
arXiv2008

Commensurability classes of (-2,3,n) pretzel knot complements

Let K be a hyperbolic (-2,3,n) pretzel knot and M = S^3 K its complement. For these knots, we verify a conjecture of Reid and Walsh: there are at most three knot complements in the commensurability class of M. Indeed, if n \neq 7, we show that M is the unique knot complement in its class. We include examples to illustrate how our methods apply to a broad class of Montesinos knots.

math.GT↗
arXiv2005

Boundary slopes (nearly) bound cyclic slopes

Let r_m and r_M be the least and greatest finite boundary slopes of a hyperbolic knot K in S^3. We show that any cyclic surgery slopes of K must lie in the interval (r_m - 1/2, r_M + 1/2).

math.GT↗
arXiv2005

Seifert fibered surgeries which do not arise from primitive/Seifert-fibered constructions

We construct two infinite families of knots each of which admits a Seifert fibered surgery with none of these surgeries coming from Dean's primitive/Seifert-fibered construction. This disproves a conjecture that all Seifert fibered surgeries arise from Dean's primitive/Seifert-fibered construction. The (-3,3,5)-pretzel knot belongs to both of the infinite families.

math.GT↗
arXiv2004

Ribbonlength of torus knots

Using Kauffman's model of flat knotted ribbons, we demonstrate how all regular polygons of at least seven sides can be realised by ribbon constructions of torus knots. We calculate length to width ratios for these constructions thereby bounding the Ribbonlength of the knots. In particular, we give evidence that the closed (respectively, truncation) Ribbonlength of a (q+1,q) torus knot is (2q+1)cot(π/(2q+1)) (resp., 2q cot(π/(2q+1))). Using these calculations, we provide the bounds c_1 \leq 2/πand c_2 \geq 5/3 cot(π/5) for the constants c_1 and c_2 that relate Ribbonlength R(K) and crossing number C(K) in a conjecture of Kusner: c_1 C(K) \leq R(K) \leq c_2 C(K).

math.GT↗
arXiv2004

Bounds on the Crosscap Number of Torus Knots

For a torus knot K, we bound the crosscap number c(K) in terms of the genus g(K) and crossing number n(K): c(K) \leq [(g(K)+9)/6] and c(K) \leq [(n(K) + 16)/12]. The (6n-2,3) torus knots show that these bounds are sharp.

math.GT↗
arXiv2004

Intrinsic knotting and linking of almost complete partite graphs

We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families, we verify a conjecture presented in Adams' "The Knot Book": If a vertex is removed from an intrinsically knotted graph, one obtains an intrinsically linked graph.

math.GT↗