Displaying similar documents to “On a problem of Sidon for polynomials over finite fields”

Robin functions and extremal functions

T. Bloom, N. Levenberg, S. Ma'u (2003)

Annales Polonici Mathematici

Similarity:

Given a compact set K N , for each positive integer n, let V ( n ) ( z ) = V K ( n ) ( z ) := sup 1 / ( d e g p ) V p ( K ) ( p ( z ) ) : p holomorphic polynomial, 1 ≤ deg p ≤ n. These “extremal-like” functions V K ( n ) are essentially one-variable in nature and always increase to the “true” several-variable (Siciak) extremal function, V K ( z ) := max[0, sup1/(deg p) log|p(z)|: p holomorphic polynomial, | | p | | K 1 ]. Our main result is that if K is regular, then all of the functions V K ( n ) are continuous; and their associated Robin functions ϱ V K ( n ) ( z ) : = l i m s u p | λ | [ V K ( n ) ( λ z ) - l o g ( | λ | ) ] increase to ϱ K : = ϱ V K for all z outside a pluripolar...

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

The norm of the polynomial truncation operator on the unit disk and on [-1,1]

Tamás Erdélyi (2001)

Colloquium Mathematicae

Similarity:

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 c of the form P ( z ) : = j = 0 n a j z j , a j C , by S ( P ) ( z ) : = j = 0 n a ̃ j z j , a ̃ j : = a j | a j | m i n | a j | , 1 (here 0/0 is interpreted as 1). We define the norms of the truncation operators by S , D r e a l : = s u p P ( m a x z D | S ( P ) ( z ) | ) / ( m a x z D | P ( z ) | ) , S , D c o m p : = s u p P c ( m a x z D | S ( P ) ( z ) | ) / ( m a x z D | P ( z ) | . Our main theorem establishes the right order of magnitude of the above norms: there is an absolute constant c₁...

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

On the Gauss-Lucas'lemma in positive characteristic

Umberto Bartocci, Maria Cristina Vipera (1988)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

If f ( x ) is a polynomial with coefficients in the field of complex numbers, of positive degree n , then f ( x ) has at least one root a with the following property: if μ k n , where μ is the multiplicity of α , then f ( k ) ( α ) 0 (such a root is said to be a "free" root of f ( x ) ). This is a consequence of the so-called Gauss-Lucas'lemma. One could conjecture that this property remains true for polynomials (of degree n ) with coefficients in a field of positive characteristic p > n (Sudbery's Conjecture). In this paper it...

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: ℝ₊ → ℝ₊.

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 .

An effective proof of the hyperelliptic Shafarevich conjecture

Rafael von Känel (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let C be a hyperelliptic curve of genus g 1 over a number field K with good reduction outside a finite set of places S of K . We prove that C has a Weierstrass model over the ring of integers of K with height effectively bounded only in terms of g , S and K . In particular, we obtain that for any given number field K , finite set of places S of K and integer g 1 one can in principle determine the set of K -isomorphism classes of hyperelliptic curves over K of genus g with good reduction outside...

Calculation of the greatest common divisor of perturbed polynomials

Zítko, Jan, Eliaš, Ján

Similarity:

The coefficients of the greatest common divisor of two polynomials f and g (GCD ( f , g ) ) can be obtained from the Sylvester subresultant matrix S j ( f , g ) transformed to lower triangular form, where 1 j d and d = deg(GCD ( f , g ) ) needs to be computed. Firstly, it is supposed that the coefficients of polynomials are given exactly. Transformations of S j ( f , g ) for an arbitrary allowable j are in details described and an algorithm for the calculation of the GCD ( f , g ) is formulated. If inexact polynomials are given, then an approximate...

Limits of log canonical thresholds

Tommaso de Fernex, Mircea Mustață (2009)

Annales scientifiques de l'École Normale Supérieure

Similarity:

Let 𝒯 n denote the set of log canonical thresholds of pairs ( X , Y ) , with X a nonsingular variety of dimension n , and Y a nonempty closed subscheme of X . Using non-standard methods, we show that every limit of a decreasing sequence in 𝒯 n lies in 𝒯 n - 1 , proving in this setting a conjecture of Kollár. We also show that 𝒯 n is closed in 𝐑 ; in particular, every limit of log canonical thresholds on smooth varieties of fixed dimension is a rational number. As a consequence of this property, we see that in...

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.

Sum-product theorems and incidence geometry

Mei-Chu Chang, Jozsef Solymosi (2007)

Journal of the European Mathematical Society

Similarity:

In this paper we prove the following theorems in incidence geometry. 1. There is δ > 0 such that for any P 1 , , P 4 , and Q 1 , , Q n 2 , if there are n ( 1 + δ ) / 2 many distinct lines between P i and Q j for all i , j , then P 1 , , P 4 are collinear. If the number of the distinct lines is < c n 1 / 2 then the cross ratio of the four points is algebraic. 2. Given c > 0 , there is δ > 0 such that for any P 1 , P 2 , P 3 2 noncollinear, and Q 1 , , Q n 2 , if there are c n 1 / 2 many distinct lines between P i and Q j for all i , j , then for any P 2 { P 1 , P 2 , P 3 } , we have δ n distinct lines between P and Q j . 3. Given...

A note on representation functions with different weights

Zhenhua Qu (2016)

Colloquium Mathematicae

Similarity:

For any positive integer k and any set A of nonnegative integers, let r 1 , k ( A , n ) denote the number of solutions (a₁,a₂) of the equation n = a₁ + ka₂ with a₁,a₂ ∈ A. Let k,l ≥ 2 be two distinct integers. We prove that there exists a set A ⊆ ℕ such that both r 1 , k ( A , n ) = r 1 , k ( A , n ) and r 1 , l ( A , n ) = r 1 , l ( A , n ) hold for all n ≥ n₀ if and only if log k/log l = a/b for some odd positive integers a,b, disproving a conjecture of Yang. We also show that for any set A ⊆ ℕ satisfying r 1 , k ( A , n ) = r 1 , k ( A , n ) for all n ≥ n₀, we have r 1 , k ( A , n ) as n → ∞.

Stabilization of monomial maps in higher codimension

Jan-Li Lin, Elizabeth Wulcan (2014)

Annales de l’institut Fourier

Similarity:

A monomial self-map f on a complex toric variety is said to be k -stable if the action induced on the 2 k -cohomology is compatible with iteration. We show that under suitable conditions on the eigenvalues of the matrix of exponents of f , we can find a toric model with at worst quotient singularities where f is k -stable. If f is replaced by an iterate one can find a k -stable model as soon as the dynamical degrees λ k of f satisfy λ k 2 &gt; λ k - 1 λ k + 1 . On the other hand, we give examples of monomial maps f , where...

On the lattice of polynomials with integer coefficients: the covering radius in L p ( 0 , 1 )

Wojciech Banaszczyk, Artur Lipnicki (2015)

Annales Polonici Mathematici

Similarity:

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 P n , r be the set of polynomials with integer coefficients. Let μ ( P n , r ; L p ) be the maximal distance of elements of P n , r from P n , r in L p ( 0 , 1 ) . We give rather precise quantitative estimates of μ ( P n , r ; L ) for n ≳ 6r. Then we obtain similar, somewhat less precise, estimates of μ ( P n , r ; L p ) for p ≠ 2. It follows that μ ( P n , r ; L p ) n - 2 r - 2 / p as n → ∞. The results...

Several quantitative characterizations of some specific groups

A. Mohammadzadeh, Ali Reza Moghaddamfar (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let G be a finite group and let π ( G ) = { p 1 , p 2 , ... , p k } be the set of prime divisors of | G | for which p 1 < p 2 < < p k . The Gruenberg-Kegel graph of G , denoted GK ( G ) , is defined as follows: its vertex set is π ( G ) and two different vertices p i and p j are adjacent by an edge if and only if G contains an element of order p i p j . The degree of a vertex p i in GK ( G ) is denoted by d G ( p i ) and the k -tuple D ( G ) = ( d G ( p 1 ) , d G ( p 2 ) , ... , d G ( p k ) ) is said to be the degree pattern of G . Moreover, if ω π ( G ) is the vertex set of a connected component of GK ( G ) , then the largest ω -number which divides | G | , is...