In this work, we address the problem of expressing sequences of $d$-orthogonal polynomials in terms of either orthogonal polynomials or the canonical basis. We derive a general recurrence relation that enables the symbolic recursive computation of these coefficients. Several results are established to investigate the impact of the Appell character, as well as the symmetry and $d$-symmetry of the polynomial sequences, on these coefficients. Additionally, we deduce some results concerning the zeros of $d$-orthogonal polynomials.
On Connection Coefficients of $d$-Orthogonal Polynomials in Terms of Orthogonal Polynomials and the Canonical Basis. // Bulletin of Materials Science. – 2026. – DOI: 10.1007/s11786-026-00631-x. – URL: https://link.springer.com/article/10.1007/s11786-026-00631-x
(2026). On Connection Coefficients of $d$-Orthogonal Polynomials in Terms of Orthogonal Polynomials and the Canonical Basis. Bulletin of Materials Science. https://doi.org/10.1007/s11786-026-00631-x
“On Connection Coefficients of $d$-Orthogonal Polynomials in Terms of Orthogonal Polynomials and the Canonical Basis.” Bulletin of Materials Science, 2026. doi:10.1007/s11786-026-00631-x.
@article{article34434,
title = {On Connection Coefficients of \$d\$-Orthogonal Polynomials in Terms of Orthogonal Polynomials and the Canonical Basis},
journal = {Bulletin of Materials Science},
year = {2026},
doi = {10.1007/s11786-026-00631-x},
url = {https://link.springer.com/article/10.1007/s11786-026-00631-x}
}
A multivariate polynomial $f$ is decomposable if $f$ is a composition $f=u\circ h$, where $u$ is a univariate polynomial of degree greater than one and $h$ is a multivariate polynomial. We consider the problem of computing the nearest...
Cancer is a major cause of mortality, yet the mechanisms governing its growth, progression, and elimination remain incompletely understood. Mathematical modeling not only clarifies these complex processes but also provides clinicians...
Residue number systems based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study a structured family of moduli of the form $2^{n} - 2^{k} + 1$,...
This work is devoted to the symbolic computation of centralizers of ordinary differential operators (ODOs), in the ring of differential operators. Starting with an operator $L$ of order $n$ and the order $\mathfrak{m}$ of a non-trivial...
A subspace $t$-design with parameters $t$-$(v,k,\lambda _{t})_{q}$ is a pair $\mathcal{D}=(\mathcal{V}, \mathcal{B})$ where $\mathcal{V}$ is the $v$-dimensional vector space over the field $\mathbb{F}_{q}$, and ℬ is a collection of...