Related papers: Integrality and rigidity for postcritically finite…
By using certain idea developed in minimal submanifold theory we study rigidity problem for self-shrinkers in the present paper. We prove rigidity results for squared norm of the second fundamental form of self-shrinkers, either under…
We introduce and study the notion of conic stability of multivariate complex polynomials in $\mathbb{C}[z_1,\ldots, z_n]$, which naturally generalizes the stability of multivariate polynomials. In particular, we generalize Borcea's and…
We classify the polynomials with integral coefficients that, when evaluated on a group element of finite order $n$, define a unit in the integral group ring for infinitely many positive integers $n$. We show that this happens if and only if…
We give a criterion when a polynomial $x^n-g$ is irreducible over a pseudofinite field. As an application we give an explicit description of algebraic closure of some pseudofinite fields of zero characteristic.
The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.
We introduce a version of the Alexander polynomial for singular knots and tangles and show how it can be strengthened considerably by introducing a perturbation. For singular long knots, we also prove that our Alexander polynomial agrees…
This paper is a follow-up to our joint paper with I. Agol, P. Storm and K. Whyte "Finiteness of arithmetic hyperbolic reflection groups". The main purpose is to investigate the effective side of the method developed there and its possible…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
In this article, we prove a rigidity criterion for period maps of admissible variations of graded-polarizable mixed Hodge structure, and establish rigidity in a number of cases, including families of quasi-projective curves, projective…
Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…
We present new classes of permutation polynomials over finite fields.
We present the strongest known knot invariant that can be computed effectively (in polynomial time).
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…
In this paper, we discuss twisted Alexander polynomials of a knot for group extensions of a finite group in two directions. Firstly, we provide a mod $p$ formula for the twisted Alexander polynomial of a knot in the $3$-sphere associated…
We prove the Pierce--Birkhoff conjecture for splines, i.e., continuous piecewise polynomials of degree $d$ in $n$ variables on a hyperplane partition of $\mathbb{R}^n$, can be written as a finite lattice combination of polynomials. We will…
We prove several new rigidity results for polynomial automorphisms of $\mathbb C^2$ with positive entropy. A first result is that a complex slice of the (forward or backward) Julia set is never a smooth, or even rectifiable, curve. We also…
Fix an integer $d\geq 2$. The parameters $c_0\in \bar{\mathbb{Q}}$ for which the unicritical polynomial $f_{d,c}(z)=z^d+c\in \mathbb{C}[z]$ has finite postcritical orbit, also known as Misiurewicz parameters, play a significant role in…
We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.