2019
DOI: 10.1016/j.laa.2018.12.029
|View full text |Cite
|
Sign up to set email alerts
|

Decomposition of some Hankel matrices generated by the generalized rencontres polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
2
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…We will prove that the matrix H (ν) (x) = H (ν;0) (x) admits a Sheffer LDU-factorization, while the matrix H (ν;1) (x) admits a Sheffer LTUfactorization. More precisely, an infinite matrix A has a Sheffer LDU-factorization [40] when there exist two Sheffer matrices S 1 and S 2 with main diagonal 1 and a diagonal matrix…”
Section: Hankel Matricesmentioning
confidence: 99%
See 1 more Smart Citation
“…We will prove that the matrix H (ν) (x) = H (ν;0) (x) admits a Sheffer LDU-factorization, while the matrix H (ν;1) (x) admits a Sheffer LTUfactorization. More precisely, an infinite matrix A has a Sheffer LDU-factorization [40] when there exist two Sheffer matrices S 1 and S 2 with main diagonal 1 and a diagonal matrix…”
Section: Hankel Matricesmentioning
confidence: 99%
“…Similarly, an infinite matrix A has a Sheffer LTU-factorization [40] when there exist two Sheffer matrices S 1 and S 2 with main diagonal 1 and a tridiagonal matrix T such that A = S 1 TS T 2 . To obtain these factorizations, we will use the exponential generating series of the infinite matrices H (ν) (x) and H (ν;1) (x).…”
Section: Hankel Matricesmentioning
confidence: 99%
“…These sequences appear in various contexts, such as applied mathematics, physics, geometric probability, interpolation of functions, number theory, umbral calculus and combinatorics. They include several classical polynomials and possess numerous algebraic, analytic and combinatorial properties [2,18,20,21] (see also [13,14,15,3,9]). Furthermore, several Sheffer polynomials can be expressed in terms of the Cayley continuants or the generalized Sylvester continuants, such as the Meixner polynomials of the first kind, the Mittag-Leffler polynomials, the Pidduck polynomials and the central factorial polynomials.…”
Section: Introductionmentioning
confidence: 99%
“…Generalized rencontres polynomials. Let m ∈ N. The generalized rencontres polynomials D (m) n (x), the generalized permutation polynomials P (m) n (x) and the generalized arrangement polynomials A (m) n (x) are defined by (see [3,5])…”
mentioning
confidence: 99%