Some families of generating functions for the extended Srivastava polynomials

Almost four decades ago, H.M. Srivastava considered a general family of univariate polynomials, the Srivastava polynomials, and initiated a systematic investigation for this family [10]. In 2001, B. González, J. Matera and H.M. Srivastava extended the Srivastava polynomials by inserting one more parameter [4]. In this study we obtain a family of linear generating functions for these extended polynomials. Some illustrative results including Jacobi, Laguerre and Bessel polynomials are also presented. Furthermore, mixed multilateral and multilinear generating functions are derived for these polynomials.     

A determinantal approach to Sheffer–Appell polynomials via monomiality principle

In this article, the Sheffer and Appell polynomials are combined to introduce the family of Sheffer–Appell polynomials by using operational methods. The determinantal definition and other properties of the Sheffer–Appell polynomials are established. As particular cases of these polynomials, the Sheffer–Bernoulli and Sheffer–Euler polynomials are introduced and their determinantal definitions are obtained. The operational correspondence between the Appell and Sheffer–Appell polynomials is used to derive the results for the Sheffer–Appell polynomials. Certain results for the Hermite–Appell and Laguerre–Appell polynomials are also obtained.     

Applications of the monotonicity of extremal zeros of orthogonal polynomials in interlacing and optimization problems

We investigate monotonicity properties of extremal zeros of orthogonal polynomials depending on a parameter. Using a functional analysis method we prove the monotonicity of extreme zeros of associated Jacobi, associated Gegenbauer and q-Meixner-Pollaczek polynomials. We show how these results can be applied to prove interlacing of zeros of orthogonal polynomials with shifted parameters and to determine optimally localized polynomials on the unit ball.     

Some properties of Hermite-based Sheffer polynomials

In this paper, the concepts and the formalism associated with monomiality principle and Sheffer sequences are used to introduce family of Hermite-based Sheffer polynomials. Some properties of Hermite-Sheffer polynomials are considered. Further, an operational formalism providing a correspondence between Sheffer and Hermite-Sheffer polynomials is developed. Furthermore, this correspondence is used to derive several new identities and results for members of Hermite-Sheffer family.     

Some families of hypergeometric polynomials and associated integral representations

The main object of this paper is to investigate several general families of hypergeometric polynomials and their associated single-, double-, and triple-integral representations. Some known or new consequences of the general results presented here, involving such classical orthogonal polynomials as the Jacobi, Laguerre, Hermite, and Bessel polynomials, and various other relatively less familiar hypergeometric polynomials, are also considered. Each of the integral representations, which are derived in this paper, may be viewed also as a linearization relationship for the product of two different members of the associated family of hypergeometric polynomials.     

Formal orthogonal polynomials revisited. Applications

From some results concerning the formal orthogonal polynomials, already proved in [5], we develop new properties of generalized adjacent polynomials which correspond to a change in the weight function. A new structure of the singular blocks is given. These results have a direct application to Lanczos methods, theG and -algorithms.     

Approximation with Bernstein–Szegö polynomials

We present approximation kernels for orthogonal expansions with respect to Bernstein–Szegö polynomials. Theconstruction is derived from known results for Chebyshev polynomials of the first kind and does not pose any restrictions on the Bernstein–Szegö polynomials.     

Bivariate fibonacci like p-polynomials

In this article, we study the bivariate Fibonacci and Lucas p-polynomials (p ? 0 is integer) from which, specifying x, y and p, bivariate Fibonacci and Lucas polynomials, bivariate Pell and Pell-Lucas polynomials, Jacobsthal and Jacobsthal-Lucas polynomials, Fibonacci and Lucas p-polynomials, Fibonacci and Lucas p-numbers, Pell and Pell-Lucas p-numbers and Chebyshev polynomials of the first and second kind, are obtained. Afterwards, we obtain some properties of the bivariate Fibonacci and Lucas p-polynomials.     

On a new family related to truncated exponential and Sheffer polynomials

In this article, the truncated exponential and Sheffer polynomials are combined to introduce the 2-variable truncated-exponential based Sheffer polynomials (2VTESP) by using operational methods. Examples of certain special polynomials belonging to this family are considered. Operational correspondence between the 2VTESP and Sheffer polynomials is established, which is applied to derive the results for some members belonging to the 2VTESP family.     

On factorization of polynomials in henselian valued fields

Guàrdia, Montes and Nart generalized the well-known method of Ore to find complete factorization of polynomials with coe?cients in finite extensions of p-adic numbers using Newton polygons of higher order (cf. [Trans. Amer. Math. Soc. 364 (2012), 361–416]). In this paper, we develop the theory of higher order Newton polygons for polynomials with coe?cients in henselian valued fields of arbitrary rank and use it to obtain factorization of such polynomials. Our approach is different from the one followed by Guàrdia et al. Some preliminary results needed for proving the main results are also obtained which are of independent interest.     

A logician's view of graph polynomials

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we distinguish between the graph theoretic (semantic) and the algebraic (syntactic) meaning of graph polynomials. Graph polynomials appear in the literature either as generating functions, as generalized chromatic polynomials, or as polynomials derived via determinants of adjacency or Laplacian matrices. We show that these forms are mutually incomparable, and propose a unified framework based on definability in Second Order Logic. We show that this comprises virtually all examples of graph polynomials with a fixed finite set of indeterminates. Finally we show that the location of zeros and stability of graph polynomials is not a semantic property. The paper emphasizes a model theoretic view. It gives a unified exposition of classical results in algebraic combinatorics together with new and some of our previously obtained results scattered in the graph theoretic literature.     

On Jacobi and continuous Hahn polynomials

Jacobi polynomials are mapped onto the continuous Hahn polynomials by the Fourier transform, and the orthogonality relations for the continuous Hahn polynomials then follow from the orthogonality relations for the Jacobi polynomials and the Parseval formula. In a special case this relation dates back to work by Bateman in 1933 and we follow a part of the historical development for these polynomials. Some applications of this relation are given.

     

Zeros of a family of hypergeometric para‐orthogonal polynomials on the unit circle

Para‐orthogonal polynomials derived from orthogonal polynomials on the unit circle are known to have all their zeros on the unit circle. In this note we study the zeros of a family of hypergeometric para‐orthogonal polynomials. As tools to study these polynomials, we obtain new results which can be considered as extensions of certain classical results associated with three term recurrence relations and differential equations satisfied by orthogonal polynomials on the real line. One of these results which might be considered as an extension of the classical Sturm comparison theorem, enables us to obtain monotonicity with respect to the parameters for the zeros of these para‐orthogonal polynomials. Finally, a monotonicity of the zeros of Meixner‐Pollaczek polynomials is proved.     

Cauchy, Ferrers-Jackson and Chebyshev polynomials and identities for the powers of elements of some conjugate recurrence sequences

In this paper some decompositions of Cauchy polynomials, Ferrers-Jackson polynomials and polynomials of the form x ²ⁿ + y ²ⁿ , n ∈ ℕ, are studied. These decompositions are used to generate the identities for powers of Fibonacci and Lucas numbers as well as for powers of the so called conjugate recurrence sequences. Also, some new identities for Chebyshev polynomials of the first kind are presented here.     

A new class of polynomials associated with Bernstein and beta polynomials

The purpose of this paper is to define a new class polynomials. Special cases of these polynomials give many famous family of the Bernstein type polynomials and beta polynomials. We also construct generating functions for these polynomials. We investigate some fundamental properties of these functions and polynomials. Using functional equations and generating functions, we derive various identities related to theses polynomials. We also construct interpolation function that interpolates these polynomials at negative integers. Finally, we give a matrix representations of these polynomials. Copyright © 2013 John Wiley & Sons, Ltd.     

Matrix exceptional Laguerre polynomials

We give an analog of exceptional polynomials in the matrix-valued setting by considering suitable factorizations of a given second-order differential operator and performing Darboux transformations. Orthogonality and density of the exceptional sequence are discussed in detail. We give an example of matrix-valued exceptional Laguerre polynomials of arbitrary size.     

Zeros of Gegenbauer and Hermite polynomials and connection coefficients

In this paper, sharp upper limit for the zeros of the ultraspherical polynomials are obtained via a result of Obrechkoff and certain explicit connection coefficients for these polynomials. As a consequence, sharp bounds for the zeros of the Hermite polynomials are obtained.

     

Generalized Lucas polynomials and relationships between the Fibonacci polynomials and Lucas polynomials

In this article, we find elements of the Lucas polynomials by using two matrices. We extend the study to the n-step Lucas polynomials. Then the Lucas polynomials and their relationship are generalized in the paper. Furthermore, we give relationships between the Fibonacci polynomials and the Lucas polynomials.     

Jack polynomials and free cumulants

We study the coefficients in the expansion of Jack polynomials in terms of power sums. We express them as polynomials in the free cumulants of the transition measure of an anisotropic Young diagram. We conjecture that such polynomials have nonnegative integer coefficients. This extends recent results about normalized characters of the symmetric group.