The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Polynomials with values which are powers of integers”

On a generalization of the Beiter Conjecture

Bartłomiej Bzdęga (2016)

Acta Arithmetica

Similarity:

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 Φ n is at least ( 1 - ε ) c w M n , where M n = i = 1 w - 2 p i 2 w - 1 - i - 1 and c w is a constant depending only on w; furthermore l i m w c w 2 - w 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: ℝ₊ → ℝ₊.

Coppersmith-Rivlin type inequalities and the order of vanishing of polynomials at 1

(2016)

Acta Arithmetica

Similarity:

For n ∈ ℕ, L > 0, and p ≥ 1 let κ p ( n , L ) be the largest possible value of k for which there is a polynomial P ≢ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L ( j = 1 n | a j | p ) 1 / p , a j , such that ( x - 1 ) k divides P(x). For n ∈ ℕ, L > 0, and q ≥ 1 let μ q ( n , L ) be the smallest value of k for which there is a polynomial Q of degree k with complex coefficients such that | Q ( 0 ) | > 1 / L ( j = 1 n | Q ( j ) | q ) 1 / q . We find the size of κ p ( n , L ) and μ q ( n , L ) for all n ∈ ℕ, L > 0, and 1 ≤ p,q ≤ ∞. The result about μ ( n , L ) is due to Coppersmith and Rivlin, but our proof is completely different and much shorter even...

Polynomials, sign patterns and Descartes' rule of signs

Vladimir Petrov Kostov (2019)

Mathematica Bohemica

Similarity:

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 pos c positive and ¬ p negative roots, where pos c ( mod 2 ) and ¬ p ( mod 2 ) . For 1 d 3 , for every possible choice of the sequence of signs of coefficients of P (called sign pattern) and for every pair ( pos , neg ) satisfying these conditions there exists a polynomial P with exactly pos positive and exactly ¬ negative roots (all of them simple). For d 4 ...

On nonsingular polynomial maps of ℝ²

Nguyen Van Chau, Carlos Gutierrez (2006)

Annales Polonici Mathematici

Similarity:

We consider nonsingular polynomial maps F = (P,Q): ℝ² → ℝ² under the following regularity condition at infinity ( J ) : There does not exist a sequence ( p k , q k ) ² of complex singular points of F such that the imaginary parts ( ( p k ) , ( q k ) ) tend to (0,0), the real parts ( ( p k ) , ( q k ) ) tend to ∞ and F ( ( p k ) , ( q k ) ) ) a ² . It is shown that F is a global diffeomorphism of ℝ² if it satisfies Condition ( J ) and if, in addition, the restriction of F to every real level set P - 1 ( c ) is proper for values of |c| large enough.

The multiplicity of the zero at 1 of polynomials with constrained coefficients

Peter Borwein, Tamás Erdélyi, Géza Kós (2013)

Acta Arithmetica

Similarity:

For n ∈ ℕ, L > 0, and p ≥ 1 let κ p ( n , L ) be the largest possible value of k for which there is a polynomial P ≠ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L ( j = 1 n | a j | p 1/p , aj ∈ ℂ , such that ( x - 1 ) k divides P(x). For n ∈ ℕ and L > 0 let κ ( n , L ) be the largest possible value of k for which there is a polynomial P ≠ 0 of the form P ( x ) = j = 0 n a j x j , | a 0 | L m a x 1 j n | a j | , a j , such that ( x - 1 ) k divides P(x). We prove that there are absolute constants c₁ > 0 and c₂ > 0 such that c 1 ( n / L ) - 1 κ ( n , L ) c 2 ( n / L ) for every L ≥ 1. This complements an earlier result of the authors valid for every n ∈ ℕ and L ∈...

Variations on a question concerning the degrees of divisors of x n - 1

Lola Thompson (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

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 [ x ] . In this paper, we replace [ x ] with 𝔽 p [ x ] , where p is an arbitrary-but-fixed prime. We also consider those n where this condition holds for all p .

Beyond two criteria for supersingularity: coefficients of division polynomials

Christophe Debry (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let f ( x ) be a cubic, monic and separable polynomial over a field of characteristic p 3 and let E be the elliptic curve given by y 2 = f ( x ) . In this paper we prove that the coefficient at x 1 2 p ( p - 1 ) in the p –th division polynomial of E equals the coefficient at x p - 1 in f ( x ) 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...

On the r -free values of the polynomial x 2 + y 2 + z 2 + k

Gongrui Chen, Wenxiao Wang (2023)

Czechoslovak Mathematical Journal

Similarity:

Let k be a fixed integer. We study the asymptotic formula of R ( H , r , k ) , which is the number of positive integer solutions 1 x , y , z H such that the polynomial x 2 + y 2 + z 2 + k is r -free. We obtained the asymptotic formula of R ( H , r , k ) for all r 2 . Our result is new even in the case r = 2 . We proved that R ( H , 2 , k ) = c k H 3 + O ( H 9 / 4 + ε ) , where c k > 0 is a constant depending on k . This improves upon the error term O ( H 7 / 3 + ε ) obtained by G.-L. Zhou, Y. Ding (2022).