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)$.

We prove that for every ε > 0 and every nonnegative integer w there exist primes $p_1,...,p_w$ such that for $n=p_1...p_w$ the height of the cyclotomic polynomial ${\Phi }_n$ is at least $(1-\epsilon )c_w{M}_n$, where $M_n={\prod }_{i=1}^{w-2}{p}_i^{2^{w-1-i}-1}$ and $c_w$ is a constant depending only on w; furthermore $li{m}_{w\to \infty }{c}_w^{2^{-w}}\approx 0.71$. In our construction we can have $p_i>h(p_1...p_{i-1})$ for all i = 1,...,w and any function h: ℝ₊ → ℝ₊.

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...

By Descartes’ rule of signs, a real degree $d$ polynomial $P$ with all nonvanishing coefficients with $c$ sign changes and $p$ sign preservations in the sequence of its coefficients ($c+p=d$) has $\mathrm{pos}\le c$ positive and $\neg \le p$ negative roots, where $\mathrm{pos}\equiv c(mod2)$ and $\neg \equiv p(mod2)$. For $1\le d\le 3$, for every possible choice of the sequence of signs of coefficients of $P$ (called sign pattern) and for every pair $(\mathrm{pos},\mathrm{neg})$ satisfying these conditions there exists a polynomial $P$ with exactly $\mathrm{pos}$ positive and exactly $\neg$ negative roots (all of them simple). For $d\ge 4$...

We investigate the recovery of $k$-sparse signals using the ${\ell }_1$-${\ell }_2$ minimization model with prior support set information. The prior support set information, which is believed to contain the indices of nonzero signal elements, significantly enhances the performance of compressive recovery by improving accuracy, efficiency, reducing complexity, expanding applicability, and enhancing robustness. We assume $k$-sparse signals $𝐱$ with the prior support $T$ which is composed of $g$ true indices and $b$ wrong...

We consider nonsingular polynomial maps F = (P,Q): ℝ² → ℝ² under the following regularity condition at infinity $\left(J_{\infty }\right)$: There does not exist a sequence $(p_k,q_k)\subset ℂ²$ of complex singular points of F such that the imaginary parts $(\Im \left(p_k\right),\Im \left(q_k\right))$ tend to (0,0), the real parts $(\Re \left(p_k\right),\Re \left(q_k\right))$ tend to ∞ and $F(\Re \left(p_k\right),\Re \left(q_k\right)))\to a\in ℝ²$. It is shown that F is a global diffeomorphism of ℝ² if it satisfies Condition $\left(J_{\infty }\right)$ and if, in addition, the restriction of F to every real level set $P^{-1}\left(c\right)$ is proper for values of |c| large enough.

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...

Let $f\left(x\right)$ be a cubic, monic and separable polynomial over a field of characteristic $p\ge 3$ and let $E$ be the elliptic curve given by $y^2=f\left(x\right)$. In this paper we prove that the coefficient at $x^{\frac{1}{2}p(p-1)}$ in the $p$–th division polynomial of $E$ equals the coefficient at $x^{p-1}$ in $f{\left(x\right)}^{\frac{1}{2}(p-1)}$. For elliptic curves over a finite field of characteristic $p$, the first coefficient is zero if and only if $E$ is supersingular, which by a classical criterion of Deuring (1941) is also equivalent to the vanishing of the second coefficient. So the...

Let $(R,𝔪)$ be a standard graded $K$-algebra over a field $K$. Then $R$ can be written as $S/I$, where $I\subseteq {(x_1,...,x_n)}^2$ is a graded ideal of a polynomial ring $S=K[x_1,...,x_n]$. Assume that $n\ge 3$ and $I$ is a strongly stable monomial ideal. We study the symmetric algebra ${\mathrm{Sym}}_R\left({\mathrm{Syz}}_1\left(𝔪\right)\right)$ of the first syzygy module ${\mathrm{Syz}}_1\left(𝔪\right)$ of $𝔪$. When the minimal generators of $I$ are all of degree 2, the dimension of ${\mathrm{Sym}}_R\left({\mathrm{Syz}}_1\left(𝔪\right)\right)$ is calculated and a lower bound for its depth is obtained. Under suitable conditions, this lower bound is reached.

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$.

Suppose that $A$ is a real symmetric matrix of order $n$. Denote by $m_A\left(0\right)$ the nullity of $A$. For a nonempty subset $\alpha$ of $\{1,2,...,n\}$, let $A\left(\alpha \right)$ be the principal submatrix of $A$ obtained from $A$ by deleting the rows and columns indexed by $\alpha$. When $m_{A\left(\alpha \right)}\left(0\right)=m_A\left(0\right)+\left|\alpha \right|$, we call $\alpha$ a P-set of $A$. It is known that every P-set of $A$ contains at most $\lfloor n/2\rfloor$ elements. The graphs of even order for which one can find a matrix attaining this bound are now completely characterized. However, the odd case turned out to be more difficult to tackle. As...