Related papers: A bracket polynomial for 2-tangle shadows
Let $R$ be a commutative ring with identity and a fixed invertible element $q^{\frac{1}{2}}$, and suppose $q+q^{-1}$ is invertible in $R$. For each planar surface $\Sigma_{0,n+1}$, we present its Kauffman bracket skein algebra over $R$ by…
We give an explicit algorithm for calculating the Kauffman bracket of a link diagram from a Goeritz matrix for that link. Further, we show how the Jones polynomial can be recovered from a Goeritz matrix when the corresponding checkerboard…
The A-polynomial encodes hyperbolic geometric information on knots and related manifolds. Historically, it has been difficult to compute, and particularly difficult to determine A-polynomials of infinite families of knots. Here, we compute…
A bracket polynomial on the integers is a function formed using the operations of addition, multiplication and taking fractional parts. For a fairly large class of bracket polynomials we show that if p is a bracket polynomial of degree k-1…
We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.
The 2-loop polynomial is a polynomial presenting the 2-loop part of the Kontsevich invariant of knots. We show a cabling formula for the 2-loop polynomial of knots. In particular, we calculate the 2-loop polynomial for torus knots.
For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…
A Kauffman bracket on a surface is an invariant for framed links in the thickened surface, satisfying the Kauffman skein relation and multiplicative under superposition. This includes representations of the skein algebra of the surface. We…
In this paper we obtained the formula for the number of irreducible polynomials with degree $n$ over finite fields of characteristic two with given trace and subtrace. This formula is a generalization of the result of Cattell et al.(2003)…
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…
In the present paper, we build a bridge between Conway-Coxeter friezes and rational tangles through the Kauffman bracket polynomials. One can compute a Kauffman bracket polynomials attached to rational links by using Conway-Coxeter friezes.…
We count with a smooth weight the number of $2 \times 2$ integer matrices with a fixed characteristic polynomial with a main term and an error term using bounds for sums of Weyl sums for quadratic roots.
This work presents formulas for the Kauffman bracket and Jones polynomials of 3-bridge knots using the structure of Chebyshev knots and their billiard table diagrams. In particular, these give far fewer terms than in the Skein relation…
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.…
We introduce and study knots and links in 2-dimensional complexes. In particular, we define linking numbers for oriented two-component links in 2-complexes and a Kauffman-type bracket polynomial for links in 2-complexes. We also discuss…
The Kauffman bracket skein modules, S(M,A), have been calculated for A=+1,-1, for all 3-manifolds M by relating them to the SL(2,C)-character varieties. We extend this description to the case when A is a 4-th root of 1 and M is either a…
By using some techniques of the divided difference operators, we establish an 4n-point interpolation formula. Certain polynomials, such as Jackson's _8\phi_7 terminating summation formula, are special cases of this formula. Based on…
We consider quantum interpolation of polynomials. We imagine a quantum computer with black-box access to input/output pairs (x_i, f(x_i)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum…
We discuss several constructions of swap polynomials, that is 2--tensor valued matrix polynomials which are multiples of the swap or switch operator.
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…