On a series of Carlitz involving ultraspherical polynomials
S. K. Chatterjea (1961)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Displaying similar documents to “Notes on a formula of Carlitz”
On a series of Carlitz involving ultraspherical polynomials
Some multiplication formulas
Leonard Carlitz (1962)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
A sufficient condition for the convexity of the area of an isoptic curve of an oval
M. Michalska (2003)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Some results involving Fox's H-function
Bajpai, S.D. (1971)
Portugaliae mathematica
Similarity:
On a generalization of Legendre polynomials
Munot, P.C. (1967)
Portugaliae mathematica
Similarity:
L multipliers and their H-L estimates on the Heisenberg group.
Chin-Cheng Lin (1995)
Revista Matemática Iberoamericana
Similarity:
We give a Hörmander-type sufficient condition on an operator-valued function M that implies the L-boundedness result for the operator T defined by (Tf)^ = Mf^ on the (2n + 1)-dimensional Heisenberg group H. Here ^ denotes the Fourier transform on H defined in terms of the Fock representations. We also show the H-L boundedness of T, ||Tf|| ≤ C||f||, for H under the same hypotheses of L-boundedness.
Some polynomials related to the ultraspherical polynomials
Carlitz, L. (1961)
Portugaliae mathematica
Similarity:
On the Cesàro and Riesz means of Fourier series
Otto Szász (1940)
Compositio Mathematica
Similarity:
Self-Avoiding Walks in the Plane Несамопресичащи се разходки в равнината
Dangovski, Rumen, Petrova, Kalina (2012)
Union of Bulgarian Mathematicians
Similarity:
Румен Руменов Данговски, Калина Христова Петрова - Разглеждаме броя на несамопресичащите се разходки с фиксирана дължина върху целочислената решетка. Завършваме анализа върху случая за лента, с дължина едно. Чрез комбинаторни аргументи получаваме точна формула за броя на разходките върху лента, ограничена отляво и отдясно. Формулата я изследваме и асимптотично. We examine the number of self-avoiding walks with a fixed length on the square grid graph and more specifically...