Related papers: A formula to evaluate type A webs and link polynom…
We introduce a certain class of link diagrams, which includes all closed braid diagrams. We show a generalized version of K\'alm\'an's full-twist formula for the HOMFLY polynomial in the class.
It is known that the Kauffman-Murasugi-Thislethwaite type inequality becomes an equality for any (possibly virtual) adequate link diagram. We refine this condition. As an application we obtain a criterion for virtual link diagram with…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
We give a formula for the coefficients of the Yablonskii-Vorob'ev polynomial. Also the reduction modulo a prime number of the polynomial is studied.
A classification and examples of four-dimensional isoclinic three-webs of codimension two are given. The examples considered prove the existence theorem for many classes of webs for which the general existence theorems are not proved yet.
In this article we will look at the PageRank algorithm used as part of the ranking process of different Internet pages in search engines by for example Google. This article has its main focus in the understanding of the behavior of PageRank…
see the old abstract and the comments here.
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
Link prediction is one of the fundamental problems in network analysis. In many applications, notably in genetics, a partially observed network may not contain any negative examples of absent edges, which creates a difficulty for many…
In this paper we give an explicit formula for the twisted Alexander polynomial of any torus link and show that it is a locally constant function on the $SL(2, \mathbb C)$-character variety. We also discuss similar things for the higher…
We provide a survey on relational models. Relational models describe complete networked {domains by taking into account global dependencies in the data}. Relational models can lead to more accurate predictions if compared to non-relational…
In this work we demonstrate that the q-numbers and their two-parameter generalization, the q,p-numbers, can be used to obtain some polynomial invariants for torus knots and links. First, we show that the q-numbers, which are closely…
We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…
Foundational material on complex Lie supergroups and their radial operators is presented. In particular, Berezin's recursion formula for describing the radial parts of fundamental operators in general linear and ortho-symplectic cases is…
In this paper, we extend the definition of a knotoid that was introduced by Turaev, to multi-linkoids that consist of a number of knot and knotoid components. We study invariants of multi-linkoids that lie in a closed orientable surface,…
We begin with modular form periods, a focal point of several Yuri Manin's works. The similarity is discussed between the corresponding zeta-polynomials and superpolynomials of algebraic links, closely related to Khovanov-Rozansky…
We give upper and lower bounds for weighted Chebyshev and residual polynomials on subsets of the real line. As an application, we prove a Szeg\H{o}-type theorem in the setting of Parreau--Widom sets.
We introduce twelve polynomial invariants for long virtual knots, called intersection polynomials, extending and refining the three intersection polynomials for virtual knots. They are defined via intersection numbers of cycles on a closed…
In this paper, we introduce a new method to prove the Lickorish-Millett type formulae for colored HOMFLY-PT polynomials of links.
We describe a method to evaluate multivariate polynomials over a finite field and discuss its multiplicative complexity.