Path count asymptotics and Stirling numbers (Q2884411): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Ergodicity of the adic transformation on the Euler graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrigendum to the paper. Generalized Eulerian numbers: combinatorial applications (this Journal vol. 265 (1974), 110—137) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4769056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random permutations and unique fully supported ergodicity for the Euler adic transformation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reinforced random walks and adic transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3596219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Euler adic dynamical system and path counts in the Euler graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834167 / rank
 
Normal rank

Revision as of 07:18, 5 July 2024

scientific article
Language Label Description Also known as
English
Path count asymptotics and Stirling numbers
scientific article

    Statements

    Path count asymptotics and Stirling numbers (English)
    0 references
    0 references
    0 references
    29 May 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Eulerian numbers
    0 references
    Stirling numbers
    0 references
    symmetric polynomials
    0 references
    reinforced random walks
    0 references
    urn models
    0 references
    0 references