Related papers: Zero testing and equation solving for sparse polyn…

In this paper, we are concerned with the problem of locating the zeros of polynomials of a quaternionic variable with quaternionic coefficients. We derive some new Cauchy bounds for the zeros of a polynomial by virtue of maximum modulus…

Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…

We obtain a family of polynomials defined by vanishing conditions and associated to tangles. We study more specifically the case where they are related to a O(n) loop model. We conjecture that their specializations at $z_i=1$ are {\it…

Sparse (or toric) elimination exploits the structure of polynomials by measuring their complexity in terms of Newton polytopes instead of total degree. The sparse, or Newton, resultant generalizes the classical homogeneous resultant and its…

Let $m,n\geq 1$ are integers and $D$ be a domain in the $$ $\mathbb C^n$ or in the $m$-dimensional real space $\mathbb R^m$. We build positive subharmonic functions on $D$ vanishing on the boundary $\partial D$ of $D$. We use such (test)…

A linear equation $E$ is said to be sparse if there is $c>0$ so that every subset of $[n]$ of size $n^{1-c}$ contains a solution of $E$ in distinct integers. The problem of characterizing the sparse equations, first raised by Ruzsa in the…

Consider a system of polynomials in many variables over the ring of integers of a number field $K$. We prove an asymptotic formula for the number of integral zeros of this system in homogeneously expanding boxes. As a consequence, any…

Let R be the ring of polynomials in n central variables over the real quaternion algebra H, and let I be a left ideal in R. We prove that if a polynomial p in R vanishes at all the common zeros of I in H^n with commuting coordinates, then…

For a set $S$ of quadratic polynomials over a finite field, let $C$ be the (infinite) set of arbitrary compositions of elements in $S$. In this paper we show that there are examples with arbitrarily large $S$ such that every polynomial in…

A quantum mechanical search procedure to determine the real zeros of a polynomial is introduced. It is based on the construction of a spin observable whose eigenvalues coincide with the zeros of the polynomial. Subsequent quantum mechanical…

Extending the work of Bell, Matsuzawa and Satriano, we consider a finite set of polynomials $S$ over a number field $K$ and give a necessary and sufficient condition for the existence of a $N \in \mathbb{N}_{> 0}$ and a finite set $Z…

Let $K$ be an algebraically closed field of characteristic $0$ and let $M_n(K)$, $n \ge 3$, be the matrix ring over $K$. We will show that the image of any multilinear polynomial in four variables evaluated on $M_n(K)$ contains all matrices…

Univariate polynomials are called stable with respect to a domain $D$ if all of their roots lie in $D$. We study linear slices of the space of stable univariate polynomials with respect to a half-plane. We show that a linear slice always…

We study the number of real zeros of trigonometric polynomials in a period and the number of zeros of self-reciprocal algebraic polynomials on the unit circle under the assumption that their coefficients are in a fixed finite set of real…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

We use the "closed point sieve" to prove a variant of a Bertini theorem over finite fields. Specifically, given a smooth quasi-projective subscheme X of P^n of dimension m over F_q, and a closed subscheme Z in P^n such that Z intersect X is…

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev $p$-norm ($1<p<\infty$) for the case $p=1$. Some relevant examples are indicated. The second part deals…

In this paper, we consider two basic questions about presenting a homogeneous polynomial f: how many variables are needed for presenting f? How can one find a presentation of f involving as few variables as possible? We give a complete…

Let ${\cal P}_n^c$ denote the set of all algebraic polynomials of degree at most $n$ with complex coefficients. Let $$D^+ := \{z \in \mathbb{C}: |z| \leq 1, \, \, \Im(z) \geq 0\}$$ be the closed upper half-disk of the complex plane. For…

Consider the $n$th degree polynomial equation, $X^n+A_{n-1}X^{n-1}+...+A_1X+A_0=0$ over the ring of 2 by 2 complex matrices. If this equation has more than ${2n \choose 2}$ solutions, then it has infinitely many solutions. We show here that…