Generalized Bell numbers and peirce matrix via Pascal matrix (Q1729008): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2018/9096761 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2887548314 / rank
 
Normal rank

Revision as of 03:18, 20 March 2024

scientific article
Language Label Description Also known as
English
Generalized Bell numbers and peirce matrix via Pascal matrix
scientific article

    Statements

    Generalized Bell numbers and peirce matrix via Pascal matrix (English)
    0 references
    0 references
    27 February 2019
    0 references
    Summary: With the Stirling matrix \(S\) and the Pascal matrix \(T\), we show that \(T^k S(k \geq 0)\) satisfies a type of generalized Stirling recurrence. Then, by expressing the sum of components of each row of \(T^k S\) as \(k\)-Bell number, we investigate properties of \(k\)-Bell numbers as well as \(k\)-Peirce matrix.
    0 references
    Stirling matrix
    0 references
    Pascal matrix
    0 references
    Bell numbers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references