Related papers: Using Twisted Alexander Polynomials to Detect Fibe…
We give an algorithm for computing the Teichm\"uller polynomial for a certain class of fibered alternating links associated to trees. Furthermore, we exhibit a mutant pair of such links distinguished by the Teichm\"uller polynomial.
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation…
For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…
We provide explicit formulas for the Alexander polynomial of pretzel knots and establish several immediate corollaries, including the characterization of pretzel knots with a trivial Alexander polynomial. As an application, we construct a…
Let $H(p)$ be the set of 2-bridge knots $K$ whose group $G$ is mapped onto a non-trivial free product, $Z/2 * Z/p$, $p$ being odd. Then there is an algebraic integer $s_0$ such that for any $K$ in $H(p)$, $G$ has a parabolic representation…
Given a fibered link, consider the characteristic polynomial of the monodromy restricted to first homology. This generalizes the notion of the Alexander polynomial of a knot. We define a construction, called iterated plumbing, to create a…
Checkerboard framings are an extension of checkerboard colorings for virtual links. According to checkerboard framings, in 2017, Dye obtained an independent invariant of virtual links: the cut point number. Checkerboard framings and cut…
The perturbed Alexander invariant $\rho_1$, defined by Bar-Natan and van der Veen, is a powerful, easily computable polynomial knot invariant with deep connections to the Alexander and colored Jones polynomials. We study the behavior of…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
Using a modified foam evaluation, we give a categorification of the Alexander polynomial of a knot. We also give a purely algebraic version of this knot homology which makes it appear as the infinite page of a spectral sequence starting at…
We extend the state models for Jones and Alexander polynomials of classical links to state models of 2-variable polynomials in the case of singular links. Moreover, we extend both of them to polynomials with d+1 variables for long singular…
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…
In this paper, we study distribution of the zeros of the Alexander polynomials of knots and links in S^3. We call a knot or link "real stable" (resp. "circular stable") if all the zeros of its Alexander polynomial are real (resp. unit…
We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…
We use d invariants of the 2-fold branched cover to show nonsliceness of a set of algebraically slice knots.
Geometric interpretations of some virtual knot invariants are given in terms of invariants of links in $\mathbb{S}^3$. Alexander polynomials of almost classical knots are shown to be specializations of the multi-variable Alexander…
In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…
Inspired by the combinatorial constructions in earlier work of the authors that generalized the classical Alexander polynomial to a large class of spatial graphs with a balanced weight on edges, we show that the value of the Alexander…
The Burau representation of the braid group can be used to recover the Alexander polynomial of the closure of a braid. We define twisted Burau maps and use them to compute twisted Alexander polynomials.