Related papers: On minimal Rolle's domains for complex polynomials

We classify dp-minimal integral domains, building off the existing classification of dp-minimal fields and dp-minimal valuation rings. We show that if R is a dp-minimal integral domain, then R is a field or a valuation ring or arises from…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

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…

A polynomial $p\in\mathbb{R}[x]$ is a divisor of some polynomial $0\neq f\in\mathbb{R}[x]$ with non-negative coefficients if and only if $p$ does not have a positive real root. The lowest possible degree of such $f$ for a given $p$ is known…

It is shown that every dp-minimal integral domain $R$ is a local ring and for every non-maximal prime ideal $\mathfrak p $ of $R$, the localization $R_{\mathfrak p }$ is a valuation ring and $\mathfrak{p}R_{\mathfrak{p}}=\mathfrak{p}$.…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

The set of minimal primes of a ring is a very important set as far the spectrum of a ring is concerned as every prime contains a minimal prime. So, knowing the minimal primes is the first (important and difficult) step in describing the…

A polynomial of degree $\ge 2$ with coefficients in the ring of $p$-adic numbers $\mathbb{Z}_p$ is studied as a dynamical system on $\mathbb{Z}_p$. It is proved that the dynamical behavior of such a system is totally described by its…

Let $\mathbb{F}_p$ be the finite field of prime order $p$. For any function $f \colon \mathbb{F}_p{}^n \to \mathbb{F}_p$, there exists a unique polynomial over $\mathbb{F}_p$ having degree at most $p-1$ with respect to each variable which…

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

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

We prove that for typical rotation numbers polynomial Siegel disks are Jordan domains with boundaries containing at least one critical point.

A family of minimal cubature rules is established on an unbounded domain, which is the first such family known on unbounded domains. The nodes of such cubature rules are common zeros of certain orthogonal polynomials on the unbounded…

The majority of traditional classification ru les minimizing the expected probability of error (0-1 loss) are inappropriate if the class probability distributions are ill-defined or impossible to estimate. We argue that in such cases class…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

We give in this article necessary and sufficient conditions on the topology of rationally and polynomially convex domains.

We give an explicit characterization of all minimal value set polynomials in $\F_q[x]$ whose set of values is a subfield $\F_{q'}$ of $\F_{q}$. We show that the set of such polynomials, together with the constants of $\F_{q'}$, is an…