Related papers: A note on the writhe polynomial and the virtual cr…

We explain how to use representation theory to give a lower bound on the dimension of the quotient ring by type $B_n$ diagonal invariants that improves upon the current known lower bound $(2n+1)^n$ by a quadratic polynomial in $n$.

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

We prove that two virtual knots have equivalent intersection graphs if and only if they have the same writhe polynomial.

We introduce three kinds of invariants of a virtual knot called the first, second, and third intersection polynomials. The definition is based on the intersection number of a pair of curves on a closed surface. The calculations of…

We introduce and study the writhe of a permutation, a circular variant of the well-known inversion number. This simple permutation statistics has several interpretations, which lead to some interesting properties. For a permutation sampled…

Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $\alpha$ under certain assumptions on $\alpha$. We prove a theorem which introduces an auxiliary polynomial…

We give a new lower bound for the discrete norm of a polynomial on the circle

The purpose of this article is to give a preliminary clarification on the relation between crossing number and crossing change. With a main focus on the span of X polynomial, we prove that, as our theorem claims, the crossing number of the…

We study the variation of the Tait number of a closed space curve according to its different projections. The results are used to compute the writhe of a knot, leading to a closed formula in case of polygonal curves.

We show a lower estimate of the Milnor number of an isolated hypersurface singularity, via its Newton number. We also obtain analogous estimate of the Milnor number of an isolated singularity of a similar complete intersection variety.

A short note on bounds on distance to variety of a point in terms of the Taylor coefficients at the point.

In this paper we give two new criteria of detecting the checkerboard colorability of virtual links by using odd writhe and arrow polynomial of virtual links, respectively. By applying new criteria, we prove that 6 virtual knots are not…

We prove a new lower bound for the Mahler measure of a polynomial in one and in several variables that depends on the complex coefficients, and the number of monomials. In one variable our result generalizes a classical inequality of…

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…

The virtual unknotting number of a virtual knot is the minimal number of crossing changes that makes the virtual knot to be the unknot, which is defined only for virtual knots virtually homotopic to the unknot. We focus on the virtual knot…

We prove new bounds on the Betti numbers of real varieties and semi-algebraic sets that have a more refined dependence on the degrees of the polynomials defining them than results known before. Our method also unifies several different…

In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…

We present a new positive lower bound for the minimum value taken by a polynomial P with integer coefficients in k variables over the standard simplex of R^k, assuming that P is positive on the simplex. This bound depends only on the number…

We prove new lower bounds on the crossing number of a complete graphs assuming that it is drawn in such a way that it contains a Hamiltonian cycle with no crossings.