Related papers: The maximum modulus set of a polynomial

We give a short proof that the limsup of the p-th root of the modulus of the p-th moment of a sequence of complex numbers is equal to the modulus of the maximum of the sequence.This strengthens known results, and provides an analog to a…

Geometrical objects with integral side lengths have fascinated mathematicians through the ages. We call a set $P=\{p_1,...,p_n\}\subset\mathbb{Z}^2$ a maximal integral point set over $\mathbb{Z}^2$ if all pairwise distances are integral and…

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 consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…

Many upper bounds for the moduli of polynomial roots have been proposed but reportedly assessed on selected examples or restricted classes only. Regarding quality measured in terms of worst-case relative overestimation of the maximum…

In 1995, Isaacs, Kantor and Spaltenstein proved that for a finite simple classical group G defined over a field with q elements, and for a prime divisor p of |G| distinct from the characteristic, the proportion of p-singular elements in G…

What is the maximum possible value of the lead coefficient of a degree $d$ polynomial $Q(x)$ if $|Q(1)|,|Q(2)|,\ldots,|Q(k)|$ are all less than or equal to one? More generally we write $L_{d,[x_k]}(x)$ for what we prove to be the unique…

We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…

The maximal degree of monomials belonging to the unique minimal system of monomial generators of the canonical module $\omega(K[{\mathcal P}])$ of the toric ring $K[{\mathcal P}]$ defined by a lattice polytope ${\mathcal P}$ will be…

We prove that if a polynomial has a root mod $p$ for every large prime $p$, then it has a real root. As an application, we show that the primes can't be covered by finitely many positive definite binary quadratic forms.

It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…

For a class of polynomials $f \in \mathbb{Z}[X]$, which in particular includes all quadratic polynomials, and also trinomials of some special form, we show that, under some natural conditions (necessary for quadratic polynomials), the set…

We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…

In this paper, we study how small a box contains at least two points from a modular cubic polynomial $y \equiv a x^3 + b x^2 + c x + d \pmod p$ with $(a, p) = 1$. We prove that some square of side length $p^{1/6 + \epsilon}$ contains two…

This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…

On a complex symplectic manifold we prove a finiteness result for the global sections of solutions of holonomic DQ-modules in two cases: (a) by assuming that there exists a Poisson compactification (b) in the algebraic case. This extends…

Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

We address some questions concerning indecomposable polynomials and their behaviour under specialization. For instance we give a bound on a prime $p$ for the reduction modulo $p$ of an indecomposable polynomial $P(x)\in \Zz[x]$ to remain…

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…