Related papers: Monomial reduction of knot polynomials

We investigate the problem of showing that the values of a given polynomial are smooth (i.e., have no large prime factors) a positive proportion of the time. Although some results exist that bound the number of smooth values of a polynomial…

We give two different, statistically consistent definitions of the length l of a prime knot tied into a polymer ring. In the good solvent regime the polymer is modelled by a self avoiding polygon of N steps on cubic lattice and l is the…

Recently, Kashaev and the first author constructed an $R$-matrix from a Nichols algebra with an automorphism, that leads, via the Reshetikhin--Turaev functor, to a multivariable polynomial invariant of knots. Applying this to a rank 2…

Let $R$ be a Dedekind ring, $\mathfrak{p}$ a nonzero prime ideal of $R$, $P\in R[X]$ a monic irreducible polynomial, and $K$ the quotient field of $R$. We give in this paper a lower bound for the $\mathfrak{p}$-adic valuation of the index…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

In this article, we study the classification of some natural numbers related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal monomial solutions. These are the…

We introduce a Poincar\'{e} polynomial with two-variable $t$ and $x$ for knots, derived from Khovanov homology, where the specialization $(t, x)$ $=$ $(1, -1)$ is a Vassiliev invariant of order $n$. Since for every $n$, there exist…

In a recent work, the combinatorial interpretation of the polynomial alpha(n;k1,k2,...,kn) counting the number of Monotone Triangles with bottom row k1 < k2 < ... < kn was extended to weakly decreasing sequences k1 >= k2 >= ... >= kn. In…

In this note we give concise formulas, which lead to a simple and fast computer program that computes a powerful knot invariant. This invariant $\rho_1$ is not new, yet our formulas are by far the simplest and fastest: given a knot we write…

Let K_s be a (-2,3,2s+1)-type Pretzel knot (s >= 3) and E(K_s)(p/q) be a closed manifold obtained by Dehn surgery along K_s with a slope p/q. We prove that if q>0, p/q >= 4s+7 and p is odd, then E(K_s)(p/q) cannot contain an R-covered…

In this article, we study the combinatorics of congruence subgroups of the modular group. More precisely, we consider the notion of minimal monomial solutions. These are the solutions of a matrix equation (also appearing in the study of…

Given a monoid $H$ (written multiplicatively), the family $\mathcal{P}_{\mathrm{fin},1}(H)$ of all non-empty finite subsets of $H$ containing the identity element $1_H$ is itself a monoid, called the reduced finitary power monoid of $H$,…

A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich $(g+1)$-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed…

The Jack polynomials with prescribed symmetry are obtained from the nonsymmetric polynomials via the operations of symmetrization, antisymmetrization and normalization. After dividing out the corresponding antisymmetric polynomial of…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

The unknotting number of a positive braid with n strands and k intersections is known to be equal to (k-n+1)/2. We consider Lorenz knots (which are positive braids) and, using a different method, find their unknotting numbers in terms of…

In 2012, Cohen, Dasbach, and Russell presented an algorithm to construct a weighted adjacency matrix for a given knot diagram. In the case of pretzel knots, it is shown that after evaluation, the determinant of the matrix recovers the Jones…

Elementary symmetric polynomials $S_n^k$ are used as a benchmark for the bounded-depth arithmetic circuit model of computation. In this work we prove that $S_n^k$ modulo composite numbers $m=p_1p_2$ can be computed with much fewer…

Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior and is only guaranteed to converge…

In previous joint work with Frohman and Lofaro a noncommutative generalization of the A-polynomial of a knot was introduced, consisting of a finitely generated ideal of polynomials (the noncommutative A-ideal) in the quantum plane. The…