Related papers: Alternating sum formulae for the determinant and o…

We extend a result of Thistlethwaite [17, Theorem 1(iv)] on the structure of the Jones polynomial of alternating links to the wider class of quasi-alternating links. In particular, we prove that the Jones polynomial of any prime…

The ribbonlength of a link is a geometric invariant defined as the infimum of the ratio of the length to the width of a folded ribbon realization of the link. In this paper, we prove that if an alternating link admits an alternating diagram…

We prove that the coefficients of the colored Jones polynomial of alternating links stabilize under increasing the number of twists in the twist regions of the link diagram. This gives us an infinite family of $q$-power series derived from…

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…

Kalfagianni and Lee found two-sided bounds for the crosscap number of an alternating link in terms of certain coefficients of the Jones polynomial. We show here that we can find similar two-sided bounds for the crosscap number of Conway…

The purpose of this article is to give a preliminary clarification on the relation between crossing number and crossing change. With a main focus on the span of X polynomial, we prove that, as our theorem claims, the crossing number of the…

X.S. Lin and O. Dasbach proved that the sum of the absolute value of the second and penultimate coefficients of the Jones polynomial of an alternating knot is equal to the twist number of the knot. In this paper we give a new proof of their…

In this paper, we present a novel method to compute the determinant of a link using Fourier-Hadamard transforms of Boolean functions. We also investigate the determinant of centrally symmetric links (a special class of strong achiral…

We study the head and tail of the colored Jones polynomial while focusing mainly on alternating links. Various ways to compute the colored Jones polynomial for a given link give rise to combinatorial identities for those power series. We…

We present a new 2-variable generalization of the Jones polynomial that can be defined through the skein relation of the Jones polynomial. The well-definedness of this new generalization is proved both algebraically and diagrammatically as…

We present a version of the matrix-tree theorem, which relates the determinant of a matrix to sums of weights of arborescences of its directed graph representation. Our treatment allows for non-zero column sums in the parent matrix by…

A determinant in algebraic $K$-theory is associated to any two almost commuting Fredholm operators. On the other hand, one can calculate a homologically defined invariant known as joint torsion. We answer in the affirmative a conjecture of…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…

We give a combinatorial interpretation of the determinant of a matrix as a generating function over Brauer diagrams in two different but related ways. The sign of a permutation associated to its number of inversions in the Leibniz formula…

The paper introduces Slope Conjecture which relates the degree of the Jones polynomial of a knot and its parallels with the slopes of incompressible surfaces in the knot complement. More precisely, we introduce two knot invariants, the…

Traditionally introduced in terms of advanced topological constructions, many link invariants may also be defined in much simpler terms given their values on a few initial links and a recursive formula on a skein triangle. Then the crucial…

Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…

We study an alternating sum involving factorials and Stirling numbers of the first kind. We give an exponential generating function for these numbers and show they are nonnegative and enumerate the number of increasing trees on $n$ vertices…

This work concentrates on the study of inverse determinant sums, which arise from the union bound on the error probability, as a tool for designing and analyzing algebraic space-time block codes. A general framework to study these sums is…