Currently displaying 1 – 7 of 7

Showing per page

Order by Relevance | Title | Year of publication

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

Tamás Erdélyi — 2001

Colloquium Mathematicae

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

The "Full Clarkson-Erdős-Schwartz Theorem" on the closure of non-dense Müntz spaces

Tamás Erdélyi — 2003

Studia Mathematica

Denote by spanf₁,f₂,... the collection of all finite linear combinations of the functions f₁,f₂,... over ℝ. The principal result of the paper is the following. Theorem (Full Clarkson-Erdős-Schwartz Theorem). Suppose ( λ j ) j = 1 is a sequence of distinct positive numbers. Then s p a n 1 , x λ , x λ , . . . is dense in C[0,1] if and only if j = 1 ( λ j ) / ( λ j ² + 1 ) = . Moreover, if j = 1 ( λ j ) / ( λ j ² + 1 ) < , then every function from the C[0,1] closure of s p a n 1 , x λ , x λ , . . . can be represented as an analytic function on z ∈ ℂ ∖ (-∞, 0]: |z| < 1 restricted to (0,1). This result improves an earlier result...

Extensions of the Bloch–Pólya theorem on the number of real zeros of polynomials

Tamás Erdélyi — 2008

Journal de Théorie des Nombres de Bordeaux

We prove that there are absolute constants c 1 &gt; 0 and c 2 &gt; 0 such that for every { a 0 , a 1 , ... , a n } [ 1 , M ] , 1 M exp ( c 1 n 1 / 4 ) , there are b 0 , b 1 , ... , b n { - 1 , 0 , 1 } such that P ( z ) = j = 0 n b j a j z j has at least c 2 n 1 / 4 distinct sign changes in ( 0 , 1 ) . This improves and extends earlier results of Bloch and Pólya.

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

Peter BorweinTamás ErdélyiGéza Kós — 2013

Acta Arithmetica

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 ∈ (0,1]. Essentially...

Page 1

Download Results (CSV)