Related papers: Recurrence relation for Jones polynomials
We show that the family of colored Jones polynomials of the closure of a braid compute weighted sums of abelianized Lefschetz numbers associated with the action of the braid on configuration spaces. The sum is over the number of…
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…
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
We give a method to construct new self-adjoint representations of the braid group. In particular, we give a family of irreducible self-adjoint representations of dimension arbitrarily large. Moreover we give sufficient conditions for a…
We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.
We provide an analogue of Wedderburn's factorization method for central polynomials with coefficients in an octonion division algebra, and present an algorithm for fully factoring polynomials of degree $n$ with $n$ conjugacy classes of…
Applications of a method recently suggested by one of the authors (R.L.) are presented. This method is based on the use of dimensional recurrence relations and analytic properties of Feynman integrals as functions of the parameter of…
We obtain a novel formula for characteristic polynomials of deformations of the Braid arrangement using the notion of levels of regions. As an application, we recover and strengthen results of Chen et al. on the characteristic polynomial of…
We use some properties of orthogonal polynomials to provide a class of upper/lower variance bounds for a function $g(X)$ of an absolutely continuous random variable $X$, in terms of the derivatives of $g$ up to some order. The new bounds…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
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…
Formulas of Rodrigues-type for the Macdonald polynomials are presented. They involve creation operators, certain properties of which are proved and other conjectured. The limiting case of the Jack polynomials is discussed.
A new method of composition orthogonality is introduced. It is applied to generate new sequences of orthogonal polynomials and functions. In particular, classical orthogonal polynomials are interpreted in the sense of composition…
Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…
In this paper we use computational method based on operational point of view to prove a new generating function of exponential polynomials. We give its applications involving geometric polynomials, Bernoulli and Euler numbers.
In this work we develop an algebraic theory of linear recurrence equations and systems with constant coefficients and reflection. We obtain explicit solutions and the Green's functions associated to different problems under general linear…
Introduction 1. The two-eigenvalue problem 2. Hecke algebra representations of braid groups 3. Duality of Jones-Wenzl representations 4. Closed images of Jones-Wenzl sectors 5. Distribution of evaluations of Jones polynomials 6. Fibonacci…