✦ LIBER ✦

An analogue of Beurling’s theorem for the Jacobi transform

✍ Scribed by Ji Zheng Huang; He Ping Liu; Jian Ming Liu

Publisher: Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year: 2008
Tongue: English
Weight: 206 KB
Volume: 25
Category: Article
ISSN: 1439-7617
DOI: 10.1007/s10114-008-6307-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Analogue of Beurling–Hörmander’s Theo

An Analogue of Beurling–Hörmander’s Theorem Associated with Partial Differential Operators

✍ Lotfi Kamoun; Khalifa Trimèche 📂 Article 📅 2005 🏛 SP Birkhäuser Verlag Basel 🌐 English ⚖ 247 KB

An analogue of Stickelberger's theorem f

An analogue of Stickelberger's theorem for the higherK-groups

✍ J. Coates; W. Sinnott 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 551 KB

An analogue of the Paley-Wiener theorem

An analogue of the Paley-Wiener theorem for the Fourier transform on certain symmetric spaces

✍ Sigurdur Helgason 📂 Article 📅 1966 🏛 Springer 🌐 English ⚖ 621 KB

An analogue of Feller's theorem for loga

An analogue of Feller's theorem for logarithmic combinatorial assemblies

✍ E. Manstavičius; J. Norkūnienė 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 180 KB

An analogue of the Bernstein theorem for

An analogue of the Bernstein theorem for the cylinder

✍ Margaryta Myronyuk 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 200 KB

Looking for an Analogue of Rice's Theore

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

✍ Bernd Borchert; Frank Stephan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

Rice's Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect a