Displaying similar documents to “A transplantation theorem for ultraspherical polynomials at critical index”

Convergence of greedy approximation II. The trigonometric system

S. V. Konyagin, V. N. Temlyakov (2003)

Studia Mathematica

Similarity:

We study the following nonlinear method of approximation by trigonometric polynomials. For a periodic function f we take as an approximant a trigonometric polynomial of the form G ( f ) : = k Λ f ̂ ( k ) e i ( k , x ) , where Λ d is a set of cardinality m containing the indices of the m largest (in absolute value) Fourier coefficients f̂(k) of the function f. Note that Gₘ(f) gives the best m-term approximant in the L₂-norm, and therefore, for each f ∈ L₂, ||f-Gₘ(f)||₂ → 0 as m → ∞. It is known from previous results that in...

On L p integrability and convergence of trigonometric series

Dansheng Yu, Ping Zhou, Songping Zhou (2007)

Studia Mathematica

Similarity:

We first give a necessary and sufficient condition for x - γ ϕ ( x ) L p , 1 < p < ∞, 1/p - 1 < γ < 1/p, where ϕ(x) is the sum of either k = 1 a k c o s k x or k = 1 b k s i n k x , under the condition that λₙ (where λₙ is aₙ or bₙ respectively) belongs to the class of so called Mean Value Bounded Variation Sequences (MVBVS). Then we discuss the relations among the Fourier coefficients λₙ and the sum function ϕ(x) under the condition that λₙ ∈ MVBVS, and deduce a sharp estimate for the weighted modulus of continuity of ϕ(x)...

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

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

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

Multifractal analysis of the divergence of Fourier series

Frédéric Bayart, Yanick Heurteaux (2012)

Annales scientifiques de l'École Normale Supérieure

Similarity:

A famous theorem of Carleson says that, given any function f L p ( 𝕋 ) , p ( 1 , + ) , its Fourier series ( S n f ( x ) ) converges for almost every x 𝕋 . Beside this property, the series may diverge at some point, without exceeding O ( n 1 / p ) . We define the divergence index at  x as the infimum of the positive real numbers β such that S n f ( x ) = O ( n β ) and we are interested in the size of the exceptional sets E β , namely the sets of  x 𝕋 with divergence index equal to  β . We show that quasi-all functions in  L p ( 𝕋 ) have a multifractal behavior with respect to...

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

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

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 harmonic Cesáro and Copson operators on the spaces L p ( ) , 1 ≤ p ≤ 2

Ferenc Móricz (2002)

Studia Mathematica

Similarity:

The harmonic Cesàro operator is defined for a function f in L p ( ) for some 1 ≤ p < ∞ by setting ( f ) ( x ) : = x ( f ( u ) / u ) d u for x > 0 and ( f ) ( x ) : = - - x ( f ( u ) / u ) d u for x < 0; the harmonic Copson operator ℂ* is defined for a function f in L ¹ l o c ( ) by setting * ( f ) ( x ) : = ( 1 / x ) x f ( u ) d u for x ≠ 0. The notation indicates that ℂ and ℂ* are adjoint operators in a certain sense. We present rigorous proofs of the following two commuting relations: (i) If f L p ( ) for some 1 ≤ p ≤ 2, then ( ( f ) ) ( t ) = * ( f ̂ ) ( t ) a.e., where f̂ denotes the Fourier transform of f. (ii) If f L p ( ) for some 1 < p ≤ 2, then...

Solution of a functional equation on compact groups using Fourier analysis

Abdellatif Chahbi, Brahim Fadli, Samir Kabbaj (2015)

Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica

Similarity:

Let G be a compact group, let n N { 0 , 1 } be a fixed element and let σ be a continuous automorphism on G such that σ n = I . Using the non-abelian Fourier transform, we determine the non-zero continuous solutions f : G C of the functional equation f ( x y ) + k = 1 n - 1 f ( σ k ( y ) x ) = n f ( x ) f ( y ) , x , y G , in terms of unitary characters of G .

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.

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

A Green's function for θ-incomplete polynomials

Joe Callaghan (2007)

Annales Polonici Mathematici

Similarity:

Let K be any subset of N . We define a pluricomplex Green’s function V K , θ for θ-incomplete polynomials. We establish properties of V K , θ analogous to those of the weighted pluricomplex Green’s function. When K is a regular compact subset of N , we show that every continuous function that can be approximated uniformly on K by θ-incomplete polynomials, must vanish on K s u p p ( d d c V K , θ ) N . We prove a version of Siciak’s theorem and a comparison theorem for θ-incomplete polynomials. We compute s u p p ( d d c V K , θ ) N when K is a compact...

Fourier approximation and embeddings of Sobolev spaces

D. E. Edmunds, V. B. Moscatelli

Similarity:

CONTENTSIntroduction............................................................................................................ 51. Preliminaries............................................................................................................. 82. Embedding into W m , p ( Ω ) into L S ( Ω ) (n>1).......................................... 103. The case n = 1.......................................................................................................... 284. Embedding W m , p ( Ω ) into L φ ( Ω ) ...............................................................

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

On the persistence of decorrelation in the theory of wave turbulence

Anne-Sophie de Suzzoni (2013)

Journées Équations aux dérivées partielles

Similarity:

We study the statistical properties of the solutions of the Kadomstev-Petviashvili equations (KP-I and KP-II) on the torus when the initial datum is a random variable. We give ourselves a random variable u 0 with values in the Sobolev space H s with s big enough such that its Fourier coefficients are independent from each other. We assume that the laws of these Fourier coefficients are invariant under multiplication by e i θ for all θ . We investigate about the persistence of the decorrelation...

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

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

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 .