arXiv research

Study on factorizations of knot polynomials for up to 12 crossings.

Study connects group invariants through outer automorphisms and polynomial relations.

Develops polynomial diffusion models for multi-factor commodity futures dynamics.

Deep tensor factorization benefits from implicit regularization with polynomial growth.

The study computes trace fields and minimal polynomials for specific knots and links.

Formula found for a specific knot's A-polynomial.

Study on periodic knots, proving limitations on their Alexander polynomials.

In this article, we explore a class of tractable interest rate models that have the property that the price of a zero-coupon bond can be expressed as a polynomial of a state diffusion process. Our results include a classification of all such time-homogeneous single-factor models in the spirit of Filipovic's maximal deg…

We observe the twisted Alexander polynomial for metabelian representations of knot groups into SL(2,C) and study relations to the characterizations of metabelian representations in the character varieties. We give a factorization of the twisted Alexander polynomial for irreducible metabelian representations with the ad…

We derive a factorization of the Alexander polynomial of the 4-strand Turk's head knot using hypergeometric representations.

For knots in $S^3$, it is well-known that the Alexander polynomial of a ribbon knot factorizes as $f(t)f(t^{-1})$ for some polynomial $f(t)$. By contrast, the Alexander polynomial of a ribbon $2$-knot is not even symmetric in general. Via an alternative notion of ribbon $2$-knots, we give a topological condition on a $…

We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a categorification of MOY polynomial. For the essential colored planar diagrams with additional…

We show that there exist infinitely many examples of pairs of knots, K_1 and K_2, that have no epimorphism $π_1(S^3\setminus K_1) \to π_1(S^3\setminus K_2)$ preserving peripheral structure although their A-polynomials have the factorization $A_{K_2}(L,M) \mid A_{K_1}(L,M)$. Our construction accounts for most of the kno…

The paper connects knot volume to $A$-polynomial structure.

The article calculates a multiplying factor to convert rational Vassiliev invariants to integer-valued ones.

Study improves HOMFLY polynomial coefficients for positive braid links.

Skew parallelogram nets factorize, encompassing discrete differential geometry.

This paper studies HOMFLY polynomials of specific and infinite classes of knots.

We study computational and sample complexity of parameter and structure learning in graphical models. Our main result shows that the class of factor graphs with bounded factor size and bounded connectivity can be learned in polynomial time and polynomial number of samples, assuming that the data is generated by a netwo…

A string link S can be closed in a canonical way to produce an ordinary closed link L. We also consider a twisted closing which produces a knot K. We give a formula for the Conway polynomial of L as a product of the Conway polynomial of K times a power series whose coefficients are given as explicit functions of the Mi…

This paper gives an algebraic characterization of Alexander polynomials of equivariant ribbon knots and a factorization condition satisfied by Alexander polynomials of equivariant slice knots.

Simplified Khovanov polynomials for bipartite links.

We prove near-tight concentration of measure for polynomial functions of the Ising model under high temperature. For any degree $d$, we show that a degree-$d$ polynomial of a $n$-spin Ising model exhibits exponential tails that scale as $\exp(-r^{2/d})$ at radius $r=\tildeΩ_d(n^{d/2})$. Our concentration radius is opti…

Simplified KR polynomial for bipartite links reduces to tensor products of vector spaces.

The paper computes group factors and properties of Wilson loops in Chern-Simons theory.

Paper defines half-Conway polynomial and computes it for knots up to 12 crossings.

Shallow neural networks can represent polynomials efficiently.

It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected components, and its representation should be the direct sum of three irreducible two-dim…

We give an extension of Fox's formula of the Alexander polynomial for double branched covers over the three-sphere. Our formula provides the Reidemeister torsion of a double branched cover along a knot for a non-trivial one dimensional representation by the product of two factors derived from the knot group. One of the…

Factor graphs are important models for succinctly representing probability distributions in machine learning, coding theory, and statistical physics. Several computational problems, such as computing marginals and partition functions, arise naturally when working with factor graphs. Belief propagation is a widely deplo…

J.P. Levine showed that the Conway polynomial of a link is a product of two factors: one is the Conway polynomial of a knot which is obtained from the link by banding together the components; and the other is determined by the $\barμ$-invariants of a string link with the link as its closure. We give another description…

We study discretizations of polynomial processes using finite state Markov processes satisfying suitable moment matching conditions. The states of these Markov processes together with their transition probabilities can be interpreted as Markov cubature rules. The polynomial property allows us to study such rules using …

Graphical models represent multivariate and generally not normalized probability distributions. Computing the normalization factor, called the partition function, is the main inference challenge relevant to multiple statistical and optimization applications. The problem is of an exponential complexity with respect to t…

Analyzes the differential expansion of knot polynomials, focusing on its applicability and modifications.

New algorithms improve approximation of matrix norms, with applications in statistics and machine learning.

We study a class of 2-variable polynomials called exact polynomials which contains $A$-polynomials of knot complements. The Mahler measure of these polynomials can be computed in terms of a volume function defined on the vanishing set of the polynomial. We prove that the local extrema of the volume function are on the …

Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient…

This work connects knot invariants to Chern-Simons theories via factorization homology.

Computes Khovanov homology for 2-strand braids via graph relations.

The Teichmueller polynomial of a fibered 3-manifold plays a useful role in the construction of mapping class having small stretch factor. We provide an algorithm that computes this polynomial of the fibered face associated to a pseudo-Anosov mapping class of a disc homeomorphism. As a byproduct, our algorithm allows us…

Polynomial processes have the property that expectations of polynomial functions (of degree $n$, say) of the future state of the process conditional on the current state are given by polynomials (of degree $\leq n$) of the current state. Here we explore the application of polynomial processes in the context of structur…

We show that Killing tensors on conformally flat $n$-dimensional tori whose conformal factor only depends on one variable, are polynomials in the metric and in the Killing vector fields. In other words, every first integral of the geodesic flow polynomial in the momenta on the sphere bundle of such a torus is linear in…

For Poincare series of binary polyhedral groups and Coxeter polynomials there are obtained statements close to the Euclid algorithm and orthogonal polynomials theory: generalized Ebeling formula, decompositions into ramified continued fractions, Christoffel-Darboux identity, combinatorial formula. Known results about t…

We give an algorithm to compute stable commutator length in free products of cyclic groups which is polynomial time in the length of the input, the number of factors, and the orders of the finite factors. We also describe some experimental and theoretical applications of this algorithm.

$R$-coloured knot polynomials for $m$-strand torus knots $Torus_{[m,n]}$ are described by the Rosso-Jones formula, which is an example of evolution in $n$ with Lyapunov exponents, labelled by Young diagrams from $R^{\otimes m}$. This means that they satisfy a finite-difference equation (recursion) of finite degree. For…

New results on algebraic knots with Brieskorn polynomials.

We give necessary and sufficient conditions for an integral polynomial without linear factors to be the characteristic polynomial of an isometry of some even, unimodular lattice of given signature. This gives rise to Hasse principle questions, which we answer in a more general setting. As an application, we prove a Has…

In this paper, we study the quantum $\mathfrak{sl}(n)$ representation category using the web space. Specially, we extend $\mathfrak{sl}(n)$ web space for $n\ge 4$ as generalized Temperley-Lieb algebras. As an application of our study, we find that the HOMFLY polynomial $P_n(q)$ specialized to a one variable polynomial …