For n ∈ ℕ, L > 0, and p ≥ 1 let ${\kappa }_p(n,L)$ be the largest possible value of k for which there is a polynomial P ≠ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0\left|\ge L\right({\sum }_{j=1}^n|a_j{|}^p$1/p$,$aj ∈ ℂ$,$such that ${(x-1)}^k$ divides P(x). For n ∈ ℕ and L > 0 let ${\kappa }_{\infty }(n,L)$ be the largest possible value of k for which there is a polynomial P ≠ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0|\ge Lma{x}_{1\le j\le n}|a_j|$, $a_j\in ℂ$, such that ${(x-1)}^k$ divides P(x). We prove that there are absolute constants c₁ > 0 and c₂ > 0 such that $c_1\surd (n/L)-1\le {\kappa }_{\infty }(n,L)\le c_2\surd (n/L)$ for every L ≥ 1. This complements an earlier result of the authors valid for every n ∈ ℕ and L ∈...

For n ∈ ℕ, L > 0, and p ≥ 1 let ${\kappa }_p(n,L)$ be the largest possible value of k for which there is a polynomial P ≢ 0 of the form $P\left(x\right)={\sum }_{j=0}^n{a}_j{x}^j$, $|a_0\left|\ge L\right({\sum }_{j=1}^n|a_j{{|}^p)}^{1/p}$, $a_j\in ℂ$, such that ${(x-1)}^k$ divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let ${\mu }_q(n,L)$ be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that $\left|Q\left(0\right)\right|>1/L({\sum }_{j=1}^n{\left|Q\left(j\right)\right|}^q{)}^{1/q}$. We find the size of ${\kappa }_p(n,L)$ and ${\mu }_q(n,L)$ for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about ${\mu }_{\infty }(n,L)$ is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even...

In this paper, we examine a natural question concerning the divisors of the polynomial $x^n-1$: “How often does $x^n-1$ have a divisor of every degree between $1$ and $n$?” In a previous paper, we considered the situation when $x^n-1$ is factored in $\mathbb{Z}\left[x\right]$. In this paper, we replace $\mathbb{Z}\left[x\right]$ with ${𝔽}_p\left[x\right]$, where $p$ is an arbitrary-but-fixed prime. We also consider those $n$ where this condition holds for all $p$.

Let D and ∂D denote the open unit disk and the unit circle of the complex plane, respectively. We denote by ₙ (resp. ${ₙ}^c$) the set of all polynomials of degree at most n with real (resp. complex) coefficients. We define the truncation operators Sₙ for polynomials $Pₙ\in {ₙ}^c$ of the form $Pₙ\left(z\right):={\sum }_{j=0}^n{a}_j{z}_j$, $a_j\in C$, by $Sₙ\left(Pₙ\right)\left(z\right):={\sum }_{j=0}^{n}a{̃}_j{z}_j$, $a{̃}_j:=a_j\left|a_j\right|min|a_j|,1$ (here 0/0 is interpreted as 1). We define the norms of the truncation operators by $\parallel Sₙ{\parallel }_{\infty ,\partial D}^{real}:=su{p}_{Pₙ\in ₙ}(ma{x}_{z\in \partial D}\left|Sₙ\left(Pₙ\right)\left(z\right)\right|)/(ma{x}_{z\in \partial D}\left|Pₙ\left(z\right)\right|)$, $\parallel Sₙ{\parallel }_{\infty ,\partial D}^{comp}:=su{p}_{Pₙ\in {ₙ}^c}(ma{x}_{z\in \partial D}\left|Sₙ\left(Pₙ\right)\left(z\right)\right|)/(ma{x}_{z\in \partial D}\left|Pₙ\left(z\right)\right|$. Our main theorem establishes the right order of magnitude of the above norms: there is an absolute constant c₁...

The paper deals with the approximation by polynomials with integer coefficients in $L_p(0,1)$, 1 ≤ p ≤ ∞. Let $P_{n,r}$ be the space of polynomials of degree ≤ n which are divisible by the polynomial $x^r{(1-x)}^r$, r ≥ 0, and let $P_{n,r}^{\mathbb{Z}}\subset P_{n,r}$ be the set of polynomials with integer coefficients. Let $\mu (P_{n,r}^{\mathbb{Z}};L_p)$ be the maximal distance of elements of $P_{n,r}$ from $P_{n,r}^{\mathbb{Z}}$ in $L_p(0,1)$. We give rather precise quantitative estimates of $\mu (P_{n,r}^{\mathbb{Z}};L₂)$ for n ≳ 6r. Then we obtain similar, somewhat less precise, estimates of $\mu (P_{n,r}^{\mathbb{Z}};L_p)$ for p ≠ 2. It follows that $\mu (P_{n,r}^{\mathbb{Z}};L_p)\asymp n^{-2r-2/p}$ as n → ∞. The results...

Let $V$ be the complex vector space of homogeneous linear polynomials in the variables $x_1,...,x_m$. Suppose $G$ is a subgroup of $S_m$, and $\chi$ is an irreducible character of $G$. Let $H_d(G,\chi )$ be the symmetry class of polynomials of degree $d$ with respect to $G$ and $\chi$. For any linear operator $T$ acting on $V$, there is a (unique) induced operator $K_{\chi }\left(T\right)\in \mathrm{End}\left(H_d(G,\chi )\right)$ acting on symmetrized decomposable polynomials by $$K_{\chi }\left(T\right)(f_1*f_2*...*f_d)=T{f}_1*T{f}_2*...*T{f}_d.$$ In this paper, we show that the representation $T\mapsto K_{\chi }\left(T\right)$ of the general linear group $GL\left(V\right)$ is equivalent to the direct sum of $\chi \left(1\right)$ copies...

Let $K=\mathbb{Q}\left(\alpha \right)$ be a pure number field generated by a complex root $\alpha$ of a monic irreducible polynomial $F\left(x\right)=x^{2^r·3^k·7^s}-m\in \mathbb{Z}\left[x\right]$, where $r$, $k$, $s$ are three positive natural integers. The purpose of this paper is to study the monogenity of $K$. Our results are illustrated by some examples.

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

Let $P$ be a polynomial with integral coefficients. Shapiro showed that if the values of $P$ at infinitely many blocks of consecutive integers are of the form $Q\left(m\right)$, where $Q$ is a polynomial with integral coefficients, then $P\left(x\right)=Q\left(R\right(x\left)\right)$ for some polynomial $R$. In this paper, we show that if the values of $P$ at finitely many blocks of consecutive integers, each greater than a provided bound, are of the form $m^q$ where $q$ is an integer greater than 1, then $P\left(x\right)={\left(R\left(x\right)\right)}^q$ for some polynomial $R\left(x\right)$.

Let $𝒜$ be the algebra of quaternions $ℍ$ or octonions $𝕆$. In this manuscript an elementary proof is given, based on ideas of Cauchy and D’Alembert, of the fact that an ordinary polynomial $f\left(t\right)\in 𝒜\left[t\right]$ has a root in $𝒜$. As a consequence, the Jacobian determinant $\left|J\right(f\left)\right|$ is always non-negative in $𝒜$. Moreover, using the idea of the topological degree we show that a regular polynomial $g\left(t\right)$ over $𝒜$ has also a root in $𝒜$. Finally, utilizing multiplication ($*$) in $𝒜$, we prove various results on the topological degree...

We obtain an estimate on the average cardinality (d,s,a) of the value set of any family of monic polynomials in ${}_q\left[T\right]$ of degree d for which s consecutive coefficients $a=(a_{d-1},...,a_{d-s})$ are fixed. Our estimate asserts that $(d,s,a)={\mu }_{d}q+\left(q^{1/2}\right)$, where ${\mu }_d:={\sum }_{r=1}^d\left({(-1)}^{r-1}\right)/(r!)$. We also prove that $₂(d,s,a)=\mu {²}_{d}q²+\left(q^{3/2}\right)$, where ₂(d,s,a) is the average second moment of the value set cardinalities for any family of monic polynomials of ${}_q\left[T\right]$ of degree d with s consecutive coefficients fixed as above. Finally, we show that $₂(d,0)=\mu {²}_{d}q²+\left(q\right)$, where ₂(d,0) denotes the average second moment for...

We consider $N$, the number of solutions $(x,y,u,v)$ to the equation ${(-1)}^{u}r{a}^x+{(-1)}^{v}s{b}^y=c$ in nonnegative integers $x,y$ and integers $u,v\in \{0,1\}$, for given integers $a\>1$, $b\>1$, $c\>0$, $r\>0$ and $s\>0$. When $gcd(ra,sb)=1$, we show that $N\le 3$ except for a finite number of cases all of which satisfy $max(a,b,r,s,x,y)\<2·{10}^{15}$ for each solution; when $gcd(a,b)\>1$, we show that $N\le 3$ except for three infinite families of exceptional cases. We find several different ways to generate an infinite number of cases giving $N=3$ solutions.