arXiv subjects
Publications and source records attributed to Pierre-Vincent Koseleff.
We study the degree of polynomial representations of knots. We give the lexicographic degree of all two-bridge knots with 11 or fewer crossings. First, we estimate the total degree of a lexicographic parametrisation of such a knot. This allows us to transform this problem into a study of real algebraic trigonal plane curves, and in particular to use the braid theoretical method developed by Orevkov.
We give a description of several representation varieties of the fundamental group of the complement of the figure eight knot in PGL(3,C) or SL(3,C). We moreover obtain an explicit parametrization of matrices generating the representation and a description of the projection of the representation variety into the character variety of the boundary torus into SL(3,C).
We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp lower bound for the lexicographic degree of any knot, using real polynomial curves properties.
Let $K$ be a link of Conway's normal form $C(m)$, $m \geq 0$, or $C(m,n)$ with $mn\textgreater{}0$, and let $D$ be a trigonal diagram of $K.$ We show that it is possible to transform $D$ into an alternating trigonal diagram, so that all intermediate diagrams remain trigonal, and the number of crossings never increases.
The harmonic knot $\H(a,b,c)$ is parametrized as $K(t)= (T_a(t) ,T_b (t), T_c (t))$ where $a$, $b$ and $c$ are pairwise coprime integers and $T_n$ is the degree $n$ Chebyshev polynomial of the first kind. We classify the harmonic knots $\H(a,b,c)$ for $ a \le 4. $ We study the knots $\H (2n-1, 2n, 2n+1),$ the knots $\H(5,n,n+1),$ and give a table of the simplest harmonic knots.
We consider Conway polynomials of two-bridge links as Euler continuant polynomials. As a consequence, we obtain new and elementary proofs of classical Murasugi's 1958 alternating theorem and Hartley's 1979 trapezoidal theorem. We give a modulo 2 congruence for links, which implies the classical Murasugi's 1971 congruence for knots. We also give sharp bounds for the coefficients of Euler continuants and deduce bounds for the Alexander polynomials of two-bridge links. These bounds improve and generalize those of Nakanishi Suketa'96. We easily obtain some bounds for the roots of the Alexander polynomials of two-bridge links. This is a partial answer to Hoste's conjecture on the roots of Alexander polynomials of alternating knots.
We show that every knot can be realized as a billiard trajectory in a convex prism. This solves a conjecture of Jones and Przytycki.
A Chebyshev knot is a knot which admits a parametrization of the form $ x(t)=T_a(t); \ y(t)=T_b(t) ; \ z(t)= T_c(t + ϕ), $ where $a,b,c$ are pairwise coprime, $T_n(t)$ is the Chebyshev polynomial of degree $n,$ and $ϕ\in \RR .$ Chebyshev knots are non compact analogues of the classical Lissajous knots. We show that there are infinitely many Chebyshev knots with $ϕ= 0.$ We also show that every knot is a Chebyshev knot.
A Chebyshev curve C(a,b,c,ϕ) has a parametrization of the form x(t)=Ta(t); y(t)=T_b(t) ; z(t)= Tc(t + ϕ), where a,b,c are integers, Tn(t) is the Chebyshev polynomial of degree n and ϕ\in \RR. When C(a,b,c,ϕ) has no double points, it defines a polynomial knot. We determine all possible knots when a, b and c are given.
A Chebyshev knot ${\cal C}(a,b,c,ϕ)$ is a knot which has a parametrization of the form $ x(t)=T_a(t); y(t)=T_b(t) ; z(t)= T_c(t + ϕ), $ where $a,b,c$ are integers, $T_n(t)$ is the Chebyshev polynomial of degree $n$ and $ϕ\in \R.$ We show that any two-bridge knot is a Chebyshev knot with $a=3$ and also with $a=4$. For every $a,b,c$ integers ($a=3, 4$ and $a$, $b$ coprime), we describe an algorithm that gives all Chebyshev knots $\cC(a,b,c,ϕ)$. We deduce a list of minimal Chebyshev representations of two-bridge knots with small crossing number.
We show that every two-bridge knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_3(t), y = T_b(t), z =C(t)$ where $T_k(t)$ are the Chebyshev polynomials and $b+°C = 3N$. If $C (t)= T_c(t)$ is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for $a \le 3.$ Most results are derived from continued fractions and their matrix representations.
We show that the Conway polynomials of Fibonacci links are Fibonacci polynomials modulo 2. We deduce that, when $ n \not\equiv 0 \Mod 4$ and $(n,j) \neq (3,3),$ the Fibonacci knot $ \cF_j^{(n)} $ is not a Lissajous knot.
We show that every rational knot $K$ of crossing number $N$ admits a polynomial parametrization $x=T_a(t), y = T_b(t), z = C(t)$ where $T_k(t)$ are the Chebyshev polynomials, $a=3$ and $b+ °C = 3N.$ We show that every rational knot also admits a polynomial parametrization with $a=4$. If $C (t)= T_c(t)$ is a Chebyshev polynomial, we call such a knot a harmonic knot. We give the classification of harmonic knots for $a \le 4.$
For every odd integer $N$ we give an explicit construction of a polynomial curve $\cC(t) = (x(t), y (t))$, where $°x = 3$, $°y = N + 1 + 2\pent N4$ that has exactly $N$ crossing points $\cC(t_i)= \cC(s_i)$ whose parameters satisfy $s_1 < ... < s_{N} < t_1 < ... < t_{N}$. Our proof makes use of the theory of Stieltjes series and Padé approximants. This allows us an explicit polynomial parametrization of the torus knot $K_{2,N}$.
We show that no torus knot of type $(2,n)$, $n>3$ odd, can be obtained from a polynomial embedding $t \mapsto (f(t), g(t), h(t))$ where $(°(f),°(g))\leq (3,n+1) $. Eventually, we give explicit examples with minimal lexicographic degree.
Few years ago, application of the mean field Bethe scheme on a given system was shown to produce a systematic change of the system intrinsic symmetry. For instance, once applied on a ferromagnet, individual spins are no more equivalent. Accordingly a new loopwise mean field theory was designed to both go beyond the one site Weiss approach and yet preserve the initial Hamitonian symmetry. This loopwise scheme is applied here to solve the Triangular Antiferromagnetic Ising model. It is found to yield Wannier's exact result of no ordering at non-zero temperature. No adjustable parameter is used. Simultaneously a non-zero critical temperature is obtained for the Triangular Ising Ferromagnet. This simple mean field scheme opens a new way to tackle random systems.