Displaying 61 – 80 of 224

Showing per page

Fejér–Riesz factorizations and the structure of bivariate polynomials orthogonal on the bi-circle

Jeffrey S. Geronimo, Plamen Iliev (2014)

Journal of the European Mathematical Society

We give a complete characterization of the positive trigonometric polynomials Q ( θ , ϕ ) on the bi-circle, which can be factored as Q ( θ , ϕ ) = | p ( e i θ , e i ϕ ) | 2 where p ( z , w ) is a polynomial nonzero for | z | = 1 and | w | 1 . The conditions are in terms of recurrence coefficients associated with the polynomials in lexicographical and reverse lexicographical ordering orthogonal with respect to the weight 1 4 π 2 Q ( θ , ϕ ) on the bi-circle. We use this result to describe how specific factorizations of weights on the bi-circle can be translated into identities relating...

Geometric Fourier analysis

Antonio Cordoba (1982)

Annales de l'institut Fourier

In this paper we continue the study of the Fourier transform on R n , n 2 , analyzing the “almost-orthogonality” of the different directions of the space with respect to the Fourier transform. We prove two theorems: the first is related to an angular Littlewood-Paley square function, and we obtain estimates in terms of powers of log ( N ) , where N is the number of equal angles considered in R 2 . The second is an extension of the Hardy-Littlewood maximal function when one consider cylinders of R n , n 2 , of fixed eccentricity...

Global orthogonality implies local almost-orthogonality.

J. Michael Wilson (2000)

Revista Matemática Iberoamericana

We introduce a new stopping-time argument, adapted to handle linear sums of noncompactly-supported functions that satisfy fairly weak decay, smoothness, and cancellation conditions. We use the argument to obtain a new Littlewood-Paley-type result for such sums.

Jacobi matrices on trees

Agnieszka M. Kazun, Ryszard Szwarc (2010)

Colloquium Mathematicae

Symmetric Jacobi matrices on one sided homogeneous trees are studied. Essential selfadjointness of these matrices turns out to depend on the structure of the tree. If a tree has one end and infinitely many origin points the matrix is always essentially selfadjoint independently of the growth of its coefficients. In case a tree has one origin and infinitely many ends, the essential selfadjointness is equivalent to that of an ordinary Jacobi matrix obtained by restriction to the so called radial functions....

Currently displaying 61 – 80 of 224