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

In this short note a differential version of the classical Weil descent is established in all characteristics. This yields a ready-to-deploy tool of differential restriction of scalars for differential varieties over finite differential…

The purpose of this paper is to give a new basis for examining the relationships of the Affine Index Polynomial and the Sawollek Polynomial. Blake Mellor has written a pioneering paper showing how the Affine Index Polynomial may be…

This paper discusses a generalization of virtual knot theory that we call multi-virtual knot theory. Multi-virtual knot theory uses a multiplicity of types of virtual crossings. As we will explain, this multiplicity is motivated by the way…

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…

We study distribution of zeros of a complex polynomial whose coefficients has been modified. We give a new proof of the theorem of Rubinstein, and with similar method we prove a new theorem that is not generalization of the previous…

This paper studies cobordism and concordance for virtual knots. We define the affine index polynomial, prove that it is a concordance invariant for knots and links (explaining when it is defined for links), show that it is also invariant…

We present a restricted variable generalization of Warning's Second Theorem (a result giving a lower bound on the number of solutions of a low degree polynomial system over a finite field, assuming one solution exists). This is analogous to…

The paper considers the Schrodinger-Maxwell system with supercritical nonlinearitie. We prove the existence of at least one non-trivial weak solution. This result is already known for the subcritical case. In this paper, we extend it to the…

We present some new lower bound estimates for certain numbers in Laver table theory and introduce several related structures of interest.

In this paper, we show how to split the writhe of reduced projections of oriented alternating links into two parts, called nullification writhe, or wx, and remaining writhe, or wy, such that the sum of these quantities equals the writhe w,…

We determine the crossing number of polynomial size curve systems on standard surfaces, in terms of the genus, up to high precision.

We present a new proof rule for verifying lower bounds on quantities of probabilistic programs. Our proof rule is not confined to almost-surely terminating programs -- as is the case for existing rules -- and can be used to establish…

Let a and b be positive integers with a \leq b. An (a,b)-triple is a set {x,ax+d,bx+ 2d}, where x,d \geq 1. Define T(a,b;r) to be the least positive integer n such that any r-coloring of {1,2...,n} contains a monochromatic (a,b)-triple.…

In this paper, we consider the poly-Bernoulli numbers and polynomials of the second kind and presents new and explicit formulae for calculating the poly-Bernoulli numbers of the second kind and the Stirling numbers of the second kind.

This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.

We generalize the Wriggle polynomial, first introduced by L. Folwaczny and L. Kauffman, to the case of virtual tangles. This generalization naturally arises when considering the self-crossings of the tangle. We prove that the generalization…

The purpose of this note is to revisit the results of arXiv:1407.4324 from a slightly different perspective, outlining how, if the integral closures of a finite set of prime ideals abide the expected convexity patterns, then the existence…

This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.

In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.

We find various lower and upper bounds for the index of Wente tori that contain a continuous family of planar principal curves. We then prove a result that gives an algorithm for computing the index sharply.