Related papers: Fewnomial bounds for completely mixed polynomial s…

We obtain upper bounds for the multiplicity of an isolated solution of a system of equations $f_1=...= f_M =0$ in $M$ variables, where the set of polynomials $(f_1,..., f_M)$ is a tuple of general position in a subvariety of a given…

We discuss existence of explicit search bounds for zeros of polynomials with coefficients in a number field. Our main result is a theorem about the existence of polynomial zeros of small height over the field of algebraic numbers outside of…

This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum…

The aim of this paper is a quantitative analysis of the solution set of a system of polynomial nonlinear differential equations, both in the ordinary and partial case. Therefore, we introduce the differential counting polynomial, a common…

Suppose $F:=(f_1,\ldots,f_n)$ is a system of random $n$-variate polynomials with $f_i$ having degree $\leq\!d_i$ and the coefficient of $x^{a_1}_1\cdots x^{a_n}_n$ in $f_i$ being an independent complex Gaussian of mean $0$ and variance…

We look at the number of solutions of an equation of the form f_1*f_2*...*f_k=a in a finite field, where each f_i is a multilinear polynomial. We use two methods to construct a solution of this problem for the cases a=0, a<>0, and we…

We develop new polynomial methods for studying systems of word equations. We use them to improve some earlier results and to analyze how sizes of systems of word equations satisfying certain independence properties depend on the lengths of…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

In this paper, we give error bounds on the number of monic irreducible polynomials $a_0+a_1x+\dots+a_{n-1}x^{n-1}+x^n$ over a finite field $\mathbb{F}_q$ of degree $n$ with $(a_0, a_1, \dots, a_{n-1}, 1)$ lying in a fixed affine algebraic…

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

Let $c_1(x),c_2(x),f_1(x),f_2(x)$ be polynomials with rational coefficients. With obvious exceptions, there can be at most finitely many roots of unity among the zeros of the polynomials $c_1(x)f_1(x)^n+c_2(x)f_2(x)^n$ with $n=1,2\ldots$.…

We introduce several notions of `random fewnomials', i.e. random polynomials with a fixed number f of monomials of degree N. The f exponents are chosen at random and then the coefficients are chosen to be Gaussian random, mainly from the…

We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…

We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.

We give a separation bound for the complex roots of a trinomial $f \in \mathbb{Z}[X]$. The logarithm of the inverse of our separation bound is polynomial in the size of the sparse encoding of $f$; in particular, it is polynomial in $\log…

In this paper, we give some counting results on integer polynomials of fixed degree and bounded height whose distinct non-zero roots are multiplicatively dependent. These include sharp lower bounds, upper bounds and asymptotic formulas for…

In this note, we provide a wide range of upper bounds for the moduli of the zeros of a complex polynomial. The obtained bounds complete a series of previous papers on the location of zeros of polynomials.

We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…

We consider a problem of bounding the maximal possible multiplicity of a zero at of some expansions $\sum a_i F_i(x)$, at a certain point $c,$ depending on the chosen family $\{F_i \}$. The most important example is a polynomial with $c=1.$…