Displaying similar documents to “A Green's function for θ-incomplete polynomials”

Estimates for polynomials in the unit disk with varying constant terms

Stephan Ruscheweyh, Magdalena Wołoszkiewicz (2011)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let · be the uniform norm in the unit disk. We study the quantities M n ( α ) : = inf ( z P ( z ) + α - α ) where the infimum is taken over all polynomials P of degree n - 1 with P ( z ) = 1 and α > 0 . In a recent paper by Fournier, Letac and Ruscheweyh (Math. Nachrichten 283 (2010), 193-199) it was shown that inf α > 0 M n ( α ) = 1 / n . We find the exact values of M n ( α ) and determine corresponding extremal polynomials. The method applied uses known cases of maximal ranges of polynomials.

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

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

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 algebra of polynomials on the space of ultradifferentiable functions

Katarzyna Grasela (2010)

Banach Center Publications

Similarity:

We consider the space of ultradifferentiable functions with compact supports and the space of polynomials on . A description of the space ( ) of polynomial ultradistributions as a locally convex direct sum is given.

On the value set of small families of polynomials over a finite field, II

Guillermo Matera, Mariana Pérez, Melina Privitelli (2014)

Acta Arithmetica

Similarity:

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

On classifying Laguerre polynomials which have Galois group the alternating group

Pradipto Banerjee, Michael Filaseta, Carrie E. Finch, J. Russell Leidy (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We show that the discriminant of the generalized Laguerre polynomial L n ( α ) ( x ) is a non-zero square for some integer pair ( n , α ) , with n 1 , if and only if ( n , α ) belongs to one of 30 explicitly given infinite sets of pairs or to an additional finite set of pairs. As a consequence, we obtain new information on when the Galois group of L n ( α ) ( x ) over is the alternating group A n . For example, we establish that for all but finitely many positive integers n 2 ( mod 4 ) , the only α for which the Galois group of L n ( α ) ( x ) over is A n is...

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

Linearly-invariant families and generalized Meixner–Pollaczek polynomials

Iwona Naraniecka, Jan Szynal, Anna Tatarczak (2013)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

The extremal functions  f 0 ( z )   realizing the maxima of some functionals (e.g. max | a 3 | , and  max a r g f ' ( z ) ) within the so-called universal linearly invariant family U α (in the sense of Pommerenke [10]) have such a form that f 0 ' ( z )   looks similar to generating function for Meixner-Pollaczek (MP) polynomials [2], [8]. This fact gives motivation for the definition and study of the generalized Meixner-Pollaczek (GMP) polynomials P n λ ( x ; θ , ψ ) of a real variable x as coefficients of G λ ( x ; θ , ψ ; z ) = 1 ( 1 - z e i θ ) λ - i x ( 1 - z e i ψ ) λ + i x = n = 0 P n λ ( x ; θ , ψ ) z n , | z | < 1 , where the parameters λ , θ , ψ satisfy the conditions:...

Location of the critical points of certain polynomials

Somjate Chaiya, Aimo Hinkkanen (2013)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let 𝔻 denote the unit disk { z : | z | < 1 } in the complex plane . In this paper, we study a family of polynomials P with only one zero lying outside 𝔻 ¯ .  We establish  criteria for P to satisfy implying that each of P and P '   has exactly one critical point outside 𝔻 ¯ .

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

The factorization of f ( x ) x n + g ( x ) with f ( x ) monic and of degree 2 .

Joshua Harrington, Andrew Vincent, Daniel White (2013)

Journal de Théorie des Nombres de Bordeaux

Similarity:

In this paper we investigate the factorization of the polynomials f ( x ) x n + g ( x ) [ x ] in the special case where f ( x ) is a monic quadratic polynomial with negative discriminant. We also mention similar results in the case that f ( x ) is monic and linear.

On some properties of Chebyshev polynomials

Hacène Belbachir, Farid Bencherif (2008)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

Letting T n (resp. U n ) be the n-th Chebyshev polynomials of the first (resp. second) kind, we prove that the sequences ( X k T n - k ) k and ( X k U n - k ) k for n - 2⎣n/2⎦ ≤ k ≤ n - ⎣n/2⎦ are two basis of the ℚ-vectorial space n [ X ] formed by the polynomials of ℚ[X] having the same parity as n and of degree ≤ n. Also T n and U n admit remarkableness integer coordinates on each of the two basis.

Uniqueness and differential polynomials of meromorphic functions sharing a nonzero polynomial

Pulak Sahoo (2016)

Mathematica Bohemica

Similarity:

Let k be a nonnegative integer or infinity. For a { } we denote by E k ( a ; f ) the set of all a -points of f where an a -point of multiplicity m is counted m times if m k and k + 1 times if m > k . If E k ( a ; f ) = E k ( a ; g ) then we say that f and g share the value a with weight k . Using this idea of sharing values we study the uniqueness of meromorphic functions whose certain nonlinear differential polynomials share a nonzero polynomial with finite weight. The results of the paper improve and generalize the related results due to...

Elements of large order on varieties over prime finite fields

Mei-Chu Chang, Bryce Kerr, Igor E. Shparlinski, Umberto Zannier (2014)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let 𝒱 be a fixed algebraic variety defined by m polynomials in n variables with integer coefficients. We show that there exists a constant C ( 𝒱 ) such that for almost all primes p for all but at most C ( 𝒱 ) points on the reduction of 𝒱 modulo p at least one of the components has a large multiplicative order. This generalises several previous results and is a step towards a conjecture of B. Poonen.

Some weighted norm inequalities for a one-sided version of g * λ

L. de Rosa, C. Segovia (2006)

Studia Mathematica

Similarity:

We study the boundedness of the one-sided operator g λ , φ between the weighted spaces L p ( M ¯ w ) and L p ( w ) for every weight w. If λ = 2/p whenever 1 < p < 2, and in the case p = 1 for λ > 2, we prove the weak type of g λ , φ . For every λ > 1 and p = 2, or λ > 2/p and 1 < p < 2, the boundedness of this operator is obtained. For p > 2 and λ > 1, we obtain the boundedness of g λ , φ from L p ( ( M ¯ ) [ p / 2 ] + 1 w ) to L p ( w ) , where ( M ¯ ) k denotes the operator M¯ iterated k times.

On sets of polynomials whose difference set contains no squares

Thái Hoàng Lê, Yu-Ru Liu (2013)

Acta Arithmetica

Similarity:

Let q [ t ] be the polynomial ring over the finite field q , and let N be the subset of q [ t ] containing all polynomials of degree strictly less than N. Define D(N) to be the maximal cardinality of a set A N for which A-A contains no squares of polynomials. By combining the polynomial Hardy-Littlewood circle method with the density increment technology developed by Pintz, Steiger and Szemerédi, we prove that D ( N ) q N ( l o g N ) 7 / N .

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 Lincei. Matematica e Applicazioni

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

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

Recurrences for the coefficients of series expansions with respect to classical orthogonal polynomials

Stanislaw Lewanowicz (2002)

Applicationes Mathematicae

Similarity:

Let P k be any sequence of classical orthogonal polynomials. Further, let f be a function satisfying a linear differential equation with polynomial coefficients. We give an algorithm to construct, in a compact form, a recurrence relation satisfied by the coefficients a k in f = k a k P k . A systematic use of the basic properties (including some nonstandard ones) of the polynomials P k results in obtaining a low order of the recurrence.