Some generalized hypergeometric d-orthogonal polynomial sets

In this paper, we characterize the d-orthogonal polynomial sets given by their explicit expressions in a specific basis. As application, we consider the generalized hypergeometric case to characterize d-orthogonal polynomial sets of Laguerre type, Meixner type, Meixner-Pollaczek type, Krawtchouk type, continuous dual Hahn type, and dual Hahn type. For d=1, we obtain a unification of some characterization theorems in the orthogonal polynomials theory.     

d-Orthogonality of Humbert and Jacobi type polynomials

In this paper, we treat three questions related to the d-orthogonality of the Humbert polynomials. The first one consists to determinate the explicit expression of the d-dimensional functional vector for which the d-orthogonality holds. The second one is the investigation of the components of Humbert polynomial sequence. That allows us to introduce, as far as we know, new d-orthogonal polynomials generalizing the classical Jacobi ones. The third one consists to solve a characterization problem related to a generalized hypergeometric representation of the Humbert polynomials.     

On the zeros of d-symmetric d-orthogonal polynomials

In this paper, we give some properties of the zeros of d-symmetric d-orthogonal polynomials and we localize these zeros on (d+1) rays emanating from the origin. We apply the obtained results to some known polynomials. In particular, we partially solve the conjecture about the zeros of the Humbert polynomials stated by Milovanovi? and Dordevi? [G.V. Milovanovi?, G.B. Dordevi?, On some properties of Humbert's polynomials, II, Ser. Math. Inform. 6 (1991) 23-30]. A study of the eigenvalues of a particular banded Hessenberg matrix is done.     

d-Symmetric d-orthogonal polynomials of Brenke type

In this paper, we characterize the d-symmetric d-orthogonal polynomials of Brenke type. We obtain two new families of polynomials and the moments of the corresponding d-dimensional vectors of linear functionals. Weights, providing integral representations for these moments, were also given.     

Uniform asymptotics of some q-orthogonal polynomials

Uniform asymptotic formulas are obtained for the Stieltjes-Wigert polynomial, the q⁻¹-Hermite polynomial and the q-Laguerre polynomial as the degree of the polynomial tends to infinity. In these formulas, the q-Airy polynomial, defined by truncating the q-Airy function, plays a significant role. While the standard Airy function, used frequently in the uniform asymptotic formulas for classical orthogonal polynomials, behaves like the exponential function on one side and the trigonometric functions on the other side of an extreme zero, the q-Airy polynomial behaves like the q-Airy function on one side and the q-Theta function on the other side. The last two special functions are involved in the local asymptotic formulas of the q-orthogonal polynomials. It seems therefore reasonable to expect that the q-Airy polynomial will play an important role in the asymptotic theory of the q-orthogonal polynomials.     

Connection and inversion coefficients for basic hypergeometric polynomials

In this paper, we give a closed-form expression of the inversion and the connection coefficients for general basic hypergeometric polynomial sets using some known inverse relations. We derive expansion formulas corresponding to all the families within the q-Askey scheme and we connect some d-orthogonal basic hypergeometric polynomials.     

The centroid of the zeroes of a polynomial via certain Laguerre-type operators

In this paper, we present several properties of the centroid of the zeroes of a polynomial. As an illustration, we apply these results to the d-orthogonal polynomials. Finally, we provide the relationship between different centroids of a general monic polynomial and its image under a certain Laguerre–type operator.     

Counting solutions to binomial complete intersections

We study the problem of counting the total number of affine solutions of a system of n binomials in n   variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is finite. We give a combinatorial formula for computing the total number of affine solutions (with or without multiplicity) from which we deduce that this counting problem is #P$\#P$-complete. We discuss special cases in which this formula may be computed in polynomial time; in particular, this is true for generic exponent vectors.     

Higher-order matching polynomials and d-orthogonality

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre polynomials—can be interpreted as matching polynomials of paths, cycles, complete graphs, and complete bipartite graphs. The notion of d-orthogonality is a generalization of the usual idea of orthogonality for polynomials and we use sign-reversing involutions to show that the higher-order Chebyshev (first and second kinds), Hermite, and Laguerre polynomials are d-orthogonal. We also investigate the moments and find generating functions of those polynomials.     

Derivations and local derivations on Freudenthal almost f-algebras

Let A be an Archimedean f  -algebra and let N(A)$N(A)$ be the set of all nilpotent elements of A. Colville et al. [4] proved that a positive linear map d:A→A$d:A\to A$ is a derivation if and only if d(A)⊂N(A)$d(A)\subset N(A)$ and d(A²)={0}$d(A^2)=\{0\}$, where A²$A^2$ is the set of all products ab in A.