scispace - formally typeset
Search or ask a question

Showing papers on "Discrete orthogonal polynomials published in 2007"


BookDOI
08 Feb 2007
TL;DR: In this article, the main recent results on positive trigonometric polynomials within a unitary framework are gathered, where the theoretical results are obtained partly from the general theory of real polynomials, and partly from self-sustained developments.
Abstract: Positive and sum-of-squares polynomials have received a special interest in the latest decade, due to their connections with semidefinite programming. Thus, efficient optimization methods can be employed to solve diverse problems involving polynomials. This book gathers the main recent results on positive trigonometric polynomials within a unitary framework; the theoretical results are obtained partly from the general theory of real polynomials, partly from self-sustained developments. The optimization applications cover a field different from that of real polynomials, mainly in signal processing problems: design of 1-D and 2-D FIR or IIR filters, design of orthogonal filterbanks and wavelets, stability of multidimensional discrete-time systems. Positive Trigonometric Polynomials and Signal Processing Applicationshas two parts: theory and applications. The theory of sum-of-squares trigonometric polynomials is presented unitarily based on the concept of Gram matrix (extended to Gram pair or Gram set). The presentation starts by giving the main results for univariate polynomials, which are later extended and generalized for multivariate polynomials. The applications part is organized as a collection of related problems that use systematically the theoretical results. All the problems are brought to a semidefinite programming form, ready to be solved with algorithms freely available, like those from the library SeDuMi.

316 citations


Journal ArticleDOI
TL;DR: The main purpose of as discussed by the authors is to present a systemic study of some families of multiple q-Euler numbers and polynomials, using the q-Volkenborn integration on Zp.
Abstract: The main purpose of this paper is to present a systemic study of some families of multiple q-Euler numbers and polynomials. In particular, by using the q-Volkenborn integration on Zp, we construct p-adic q-Euler numbers and polynomials of higher order. We also define new generating functions of multiple q-Euler numbers and polynomials. Furthermore, we construct Euler q-Zeta function.

225 citations


Journal ArticleDOI
TL;DR: It is shown how Hahn moments, as a generalization of Chebyshev and Krawtchouk moments, can be used for global and local feature extraction and incorporated into the framework of normalized convolution to analyze local structures of irregularly sampled signals.
Abstract: This paper shows how Hahn moments provide a unified understanding of the recently introduced Chebyshev and Krawtchouk moments. The two latter moments can be obtained as particular cases of Hahn moments with the appropriate parameter settings and this fact implies that Hahn moments encompass all their properties. The aim of this paper is twofold: (1) To show how Hahn moments, as a generalization of Chebyshev and Krawtchouk moments, can be used for global and local feature extraction and (2) to show how Hahn moments can be incorporated into the framework of normalized convolution to analyze local structures of irregularly sampled signals.

192 citations


Proceedings ArticleDOI
21 Oct 2007
TL;DR: The results constitute the first progress on these problems since the long-standing generator by Luby, Velickovic and Wigderson (ISTCS1993), whose seed length is much bigger: s = exp (Omega(radiclogn)), even for the case of degree-2 polynomials over F2.
Abstract: We present a new approach to constructing pseudorandom generators that fool low-degree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain the following main constructions of explicitly computable generators G : FsrarrFn that fool polynomials over a prime field F: (1) a generator that fools degree-2 (i.e., quadratic) polynomials to within error 1/n, with seed length s = O(log n); (2) a generator that fools degree-3 (i.e., cubic) polynomials to within error epsiv, with seed length s = O(Iog|F| n) + f(epsiv, F) where f depends only on epsiv and F (not on n), (3) assuming the "Gowers inverse conjecture," for every d a generator that fools degree-d polynomials to within error epsiv, with seed length, s = O(dldrIog|F| n) + f(d, epsiv, F) where f depends only on d, epsiv, and F (not on n). We stress that the results in (1) and (2) are unconditional, i.e. do not rely on any unproven assumption. Moreover, the results in (3) rely on a special case of the conjecture which may be easier to prove. Our generator for degree-d polynomials is the component-wise sum of d generators for degree-l polynomials (on independent seeds). Prior to our work, generators with logarithmic seed length were only known for degree-1 (i.e., linear) polynomials (Naor and Naor; SIAM J. Comput., 1993). In fact, over small fields such as F2 = {0,1}, our results constitute the first progress on these problems since the long-standing generator by Luby, Velickovic and Wigderson (ISTCS1993), whose seed length is much bigger: s = exp (Omega(radiclogn)), even for the case of degree-2 polynomials over F2.

185 citations


Journal ArticleDOI
TL;DR: A new set of discrete orthogonal moments is proposed, based on the discrete Racah polynomials, which eliminate the need for numerical approximations and demonstrate Racah moments' feature representation capability by means of image reconstruction and compression.

182 citations


Journal ArticleDOI
TL;DR: The proposed dual Hahn moments perform better than the Legendre moments, Tchebichef moments, and Krawtchouk moments in terms of image reconstruction capability in both noise-free and noisy conditions.

180 citations


Journal ArticleDOI
TL;DR: It is given new sufficient conditions for a sequence of polynomials to have only real zeros based on the method of interlacing zeros, and settles certain conjectures of Stahl on genus polynmials by proving them for certain classes of graphs.

144 citations


Journal ArticleDOI
TL;DR: In this paper, the authors derived closed-form polynomials that are orthogonal over a hexagonal pupil, such as the hexagonal segments of a large mirror.
Abstract: Zernike circle polynomials are in widespread use for wavefront analysis because of their orthogonality over a circular pupil and their representation of balanced classical aberrations. In recent papers, we derived closed-form polynomials that are orthonormal over a hexagonal pupil, such as the hexagonal segments of a large mirror. We extend our work to elliptical, rectangular, and square pupils. Using the circle polynomials as the basis functions for their orthogonalization over such pupils, we derive closed-form polynomials that are orthonormal over them. These polynomials are unique in that they are not only orthogonal across such pupils, but also represent balanced classical aberrations, just as the Zernike circle polynomials are unique in these respects for circular pupils. The polynomials are given in terms of the circle polynomials as well as in polar and Cartesian coordinates. Relationships between the orthonormal coefficients and the corresponding Zernike coefficients for a given pupil are also obtained. The orthonormal polynomials for a one-dimensional slit pupil are obtained as a limiting case of a rectangular pupil.

140 citations


Journal ArticleDOI
TL;DR: In this article, the λ-Euler numbers and polynomials were constructed by using fermionic expression of p-adic invariant integrals on Z p involving trigonometric functions.

133 citations


Book
02 Jan 2007
TL;DR: In this paper, the explicit solution of Riemann-Hilbert Problem is presented as a proof of the Hahn Equilibrium Measure: the Proof of Theorem 2.17.
Abstract: Preface vii Chapter 1. Introduction 1 Chapter 2. Asymptotics of General Discrete Orthogonal Polynomials in the Complex Plane 25 Chapter 3. Applications 49 Chapter 4. An Equivalent Riemann-Hilbert Problem 67 Chapter 5. Asymptotic Analysis 87 Chapter 6. Discrete Orthogonal Polynomials: Proofs of Theorems Stated in x2.3 105 Chapter 7. Universality: Proofs of Theorems Stated in x3.3 115 Appendix A. The Explicit Solution of Riemann-Hilbert Problem 5.1 135 Appendix B. Construction of the Hahn Equilibrium Measure: the Proof of Theorem 2.17 145 Appendix C. List of Important Symbols 153 Bibliography 163 Index 167

115 citations


Book ChapterDOI
Qiang Wang1
31 May 2007
TL;DR: This work explores a connection between permutation polynomials of the form xrf(x(q-1)/l) and cyclotomic mapping permutation coefficients over finite fields and characterize a class of permutation binomials in terms of generalized Lucas sequences.
Abstract: We explore a connection between permutation polynomials of the form xrf(x(q-1)/l) and cyclotomic mapping permutation polynomials over finite fields. As an application, we characterize a class of permutation binomials in terms of generalized Lucas sequences.

Journal ArticleDOI
TL;DR: In this paper, the authors consider polynomials orthogonal on [0, ∞] with respect to Laguerre-type weights w(x) = xα e-Q(x), where α > -1 and where Q denotes a polynomial with a positive leading coefficient.
Abstract: We consider polynomials orthogonal on [0,∞) with respect to Laguerre-type weights w(x) = xα e-Q(x), where α > -1 and where Q denotes a polynomial with positive leading coefficient. The main purpose of this paper is to determine Plancherel-Rotach-type asymptotics in the entire complex plane for the orthonormal polynomials with respect to w, as well as asymptotics of the corresponding recurrence coefficients and of the leading coefficients of the orthonormal polynomials. As an application we will use these asymptotics to prove universality results in random matrix theory. We will prove our results by using the characterization of orthogonal polynomials via a 2 × 2 matrix valued Riemann--Hilbert problem, due to Fokas, Its, and Kitaev, together with an application of the Deift-Zhou steepest descent method to analyze the Riemann-Hilbert problem asymptotically.

Book
02 Jan 2007

Journal ArticleDOI
TL;DR: In this article, a generalization of multiple orthogonal polynomials of types I and II is presented, which are called MOPs of mixed type, and some basic properties are formulated, and a Riemann-Hilbert problem is given.

Journal ArticleDOI
TL;DR: Orthogonal Chebyshev polynomials are developed to approximate the solutions of linear and nonlinear Volterra integral equations to a system of linear or nonlinear algebraic equations.

Journal ArticleDOI
TL;DR: In this paper, Tratnik derived two systems of multivariable orthogonal Racah polynomials and considered their limit cases, and extended them to q-Racah and q-Hahn.
Abstract: In 1991 Tratnik derived two systems of multivariable orthogonal Racah polynomials and considered their limit cases. q-Extensions of these systems are derived, yielding systems of multivariable orthogonal q-Racah polynomials, from which systems of multivariable orthogonal q-Hahn, dual q-Hahn, q-Krawtchouk, q-Meixner, and q-Charlier polynomials follow as special or limit cases.

Posted Content
TL;DR: In this paper, the modified q-Euler numbers and polynomiasl were constructed and many identities related to these numbers were given, as well as many identities of these numbers and Polynomials.
Abstract: In the recent paper the interesting q-Euler numbers and polynomials introduced in JMAA. The purpose of this paper is to construct the modified q-Euler numbers and polynomiasl. Finally we will give the interesting many identities related to these numbers and polynomials.

Book ChapterDOI
21 Jun 2007
TL;DR: A new extension for multivariate polynomials is introduced; through a new definition of density leading Toom strategy to be efficient, and a method is proposed to find the faster Toom multiplication algorithm for any given splitting order.
Abstract: Toom-Cook strategy is a well-known method for building algorithms to efficiently multiply dense univariate polynomials. Efficiency of the algorithm depends on the choice of interpolation points and on the exact sequence of operations for evaluation and interpolation. If carefully tuned, it gives the fastest algorithm for a wide range of inputs. This work smoothly extends the Toom strategy to polynomial rings, with a focus on . Moreover a method is proposed to find the faster Toom multiplication algorithm for any given splitting order. New results found with it, for polynomials in characteristic 2, are presented. A new extension for multivariate polynomials is also introduced; through a new definition of density leading Toom strategy to be efficient.

Journal ArticleDOI
TL;DR: In this article, a biorthogonal extension of the Stieltjes-Wigert polynomials is presented for exact computations in Chern-Simons matrix models.
Abstract: Employing the random matrix formulation of Chern-Simons theory on Seifert manifolds, we show how the Stieltjes-Wigert orthogonal polynomials are useful in exact computations in Chern-Simons matrix models. We construct a biorthogonal extension of the Stieltjes-Wigert polynomials, not available in the literature, necessary to study Chern-Simons matrix models when the geometry is a lens space. We also study the relationship between Stieltjes-Wigert and Rogers-Szego polynomials and the corresponding equivalence with a unitary matrix model. Finally, we give a detailed proof of a result that relates quantum dimensions with averages of Schur polynomials in the Stieltjes-Wigert ensemble.

Journal ArticleDOI
TL;DR: The Romanovski polynomials as mentioned in this paper have a finite orthogonality and are used for exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory.
Abstract: We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.

Journal ArticleDOI
TL;DR: A matrix characterization of the PNS, that is the positive homogeneous forms that are not SOS, is proposed, which allows to show that any PNS is the vertex of an unbounded cone of PNS.
Abstract: This note investigates the gap existing between positive polynomials and sum of squares (SOS) of polynomials, which affects several analysis and synthesis tools in control systems based on polynomial SOS relaxations, and about which almost nothing is known. In particular, a matrix characterization of the PNS, that is the positive homogeneous forms that are not SOS, is proposed, which allows to show that any PNS is the vertex of an unbounded cone of PNS. Moreover, a complete parametrization of the set of PNS is introduced.

Journal ArticleDOI
TL;DR: In this paper, the authors give a survey concerning both very classical and recent results on the electrostatic interpretation of the zeros of some well-known families of polynomials and the interplay between these models and the asymptotic distribution of their zeros.

Journal ArticleDOI
TL;DR: The quadratic harness condition was introduced in this article, where it was shown that integrable quadrastic harnesses have orthogonal martingale polynomials with a three-step recurrence that satisfies a -commutation relation.
Abstract: We introduce the quadratic harness condition and show that integrable quadratic harnesses have orthogonal martingale polynomials with a three step recurrence that satisfies a -commutation relation. This implies that quadratic harnesses are essentially determined uniquely by five numerical constants. Explicit recurrences for the orthogonal martingale polynomials are derived in several cases of interest.

Proceedings ArticleDOI
07 Sep 2007
TL;DR: In this article, a direct and elementary approach to construct a set of homogeneous polynomials involving only products of a hypercomplex variable and its hypercomplex conjugate is presented.
Abstract: In Clifford Analysis, several different methods have been developed for constructing monogenic functions as series with respect to properly chosen homogeneous monogenic polynomials. Almost all these methods rely on sets of orthogonal polynomials with their origin in classical (real) Harmonic Analysis in order to obtain the desired basis of homogeneous polynomials. We use a direct and elementary approach to this problem and construct a set of homogeneous polynomials involving only products of a hypercomplex variable and its hypercomplex conjugate. The obtained set is an Appell set of monogenic polynomials with respect to the hypercomplex derivative. Its intrinsic properties and some applications are presented.

Journal ArticleDOI
TL;DR: The determination of the orthonormal hexagonal polynomials is demonstrated as an example of the matrix approach, because it is nonrecursvie and can be performed rapidly with matrix transformations.
Abstract: A general theoretical approach has been developed for the determination of orthonormal polynomials over any integrable domain, such as a hexagon. This approach is better than the classical Gram-Schmidt orthogonalization process because it is nonrecursvie and can be performed rapidly with matrix transformations. The determination of the orthonormal hexagonal polynomials is demonstrated as an example of the matrix approach.

Posted Content
TL;DR: A short survey of a class of functions introduced by Tom Apostol is given in this article, focusing on their relation to Eulerian polynomials, derivative polynomorphisms, and also on some integral representations.
Abstract: This is a short survey of a class of functions introduces by Tom Apostol. The survey is focused on their relation to Eulerian polynomials, derivative polynomials, and also on some integral representations.

Journal ArticleDOI
TL;DR: The main purpose of as mentioned in this paper is to display new families of matrix valued orthogonal polynomials satisfying second-order differential equations, obtained from the representation theory of U(n).
Abstract: The main purpose of this paper is to display new families of matrix valued orthogonal polynomials satisfying second-order differential equations, obtained from the representation theory of U(n). Given an arbitrary positive definite weight matrix W(t) one can consider the corresponding matrix valued orthogonal polynomials. These polynomials will be eigenfunctions of some symmetric second-order differential operator D only for very special choices of W(t). Starting from the theory of spherical functions associated to the pair (SU(n+1), U(n)) we obtain new families of such pairs {W,D}. These depend on enough integer parameters to obtain an immediate extension beyond these cases.

Journal ArticleDOI
TL;DR: In this article, the first author constructed new generating functions of the new twisted (h, q)-Bernoulli polynomials and numbers by using q-Volkenborn integral.
Abstract: In this paper, by using q-Volkenborn integral[10], the first author[25] constructed new generating functions of the new twisted (h, q)-Bernoulli polynomials and numbers. We define higher-order twis...

Journal ArticleDOI
TL;DR: In this article, q-Euler numbers and polynomials were studied by using p-adic q-fermionic integrals on Z_p, where p is the number of vertices.
Abstract: In this paper we study q-Euler numbers and polynomials by using p-adic q-fermionic integrals on Z_p. The methods to study q-Euler numbers and polynomials in this paper are new.

Journal ArticleDOI
TL;DR: In this paper, the authors give an explicit description of the limit key polynomials, which can be viewed as a generalization of the Artin-Schreier polynomial.