Enumeration of r-smooth words over a finite alphabet (Q5889960): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Connection between ordinary multinomials, generalized Fibonacci numbers, partial Bell partition polynomials and convolution powers of discrete uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the enumeration of restricted words over a finite alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Patterns in permutations and words. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2915623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Staircase words and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth partitions and Chebyshev polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smooth column convex polyominoes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting inversion sequences by parity successions and runs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic and Geometric Representations of the Generalized n-anacci Constants / rank
 
Normal rank

Revision as of 00:35, 1 August 2024

scientific article; zbMATH DE number 7680470
Language Label Description Also known as
English
Enumeration of r-smooth words over a finite alphabet
scientific article; zbMATH DE number 7680470

    Statements

    Identifiers