Related papers: Alternating sum formulae for the determinant and o…
We construct an infinite family of links which are both almost alternating and quasi-alternating from a given either almost alternating diagram representing a quasi-alternating link, or connected and reduced alternating tangle diagram. To…
Recently, Bigelow defined a diagrammatic method for calculating the Alexander polynomial of a knot or link by resolving crossings in a planar algebra. I will present my multivariate version of Bigelow's calculation. The advantage to my…
A rational link may be represented by any of the (infinitely) many link diagrams corresponding to various continued fraction expansions of the same rational number. The continued fraction expansion of the rational number in which all signs…
Twisted links are obtained from a base link by starting with a $n$-braid representation, choosing several ($m$) adjacent strands, and applying one or more twists to the set. Various restrictions may be applied, e.g. the twists may be…
We examine the conjecture, due to Champanerkar, Kofman, and Purcell that $\text{vol}(K) < 2 \pi \log \det (K)$ for alternating hyperbolic links, where $\text{vol}(K) = \text{vol}(S^3\backslash K)$ is the hyperbolic volume and $\det(K)$ is…
The Turaev genus defines a natural filtration on knots where Turaev genus zero knots are precisely the alternating knots. We show that the signature of a Turaev genus one knot is determined by the number of components in its all-A Kauffman…
Consider a graph whose edges have been colored red and blue. Assign a nonnegative real weight to every edge so that at every vertex, the sum of the weights of the incident red edges equals the sum of the weights of the incident blue edges.…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
The colored Jones polynomial is a knot invariant that plays a central role in low dimensional topology. We give a simple and an efficient algorithm to compute the colored Jones polynomial of any knot. Our algorithm utilizes the walks along…
It is known that the minimal degree of the Jones polynomial of a positive knot is equal to its genus, and the minimal coefficient is 1. We extend this result to almost positive links and partly identify the 3 following coefficients for…
It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight…
Given any oriented link diagram, two types of new knot invariants are constructed. They satisfy some generalized skein relations. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations of those…
The paper concerns the tree invariants of string links, introduced by Kravchenko and Polyak and closely related to the classical Milnor linking numbers also known as $\bar{\mu}$--invariants. We prove that, analogously as for…
If the twist numbers of a collection of oriented alternating link diagrams are bounded, then the Alexander polynomials of the corresponding links have bounded euclidean Mahler measure (see Definition 1.2). The converse assertion does not…
For $D$ a reduced alternating surface link diagram, we bound the twist number of $D$ in terms of the coefficients of a polynomial invariant. To this end, we introduce a generalization of the homological Kauffman bracket defined by Krushkal.…
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both…
We prove that the degree of the Brandt-Lickorish-Millet polynomial of any quasi-alternating link is less than its determinant. Therefore, we obtain a new and a simple obstruction criterion for quasi-alternateness. As an application, we…
A state generating is introduced to determine the Jones polynomial of a link. Formulae for two infinite families of knots are shown by applying this method, the second family of which are proved to be non-alternating. Moreover, the method…
We give a new construction of the one-variable Alexander polynomial of an oriented knot or link, and show that it generalizes to a vector valued invariant of oriented tangles.
In this paper, we define a class of auxiliary graphs associated with simple undirected graphs. This class of auxiliary graphs is based on the set of spanning trees of the original graph and the edges constituting those spanning trees. A…