Talmudic lattice path counting (Q1336450): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A problem of arrangements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Lemma and Its Application to Probability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5736143 / rank
 
Normal rank

Latest revision as of 09:58, 23 May 2024

scientific article
Language Label Description Also known as
English
Talmudic lattice path counting
scientific article

    Statements

    Talmudic lattice path counting (English)
    0 references
    0 references
    0 references
    0 references
    22 November 1994
    0 references
    Consider all planar walks, with positive unit steps (1,0) and (0,1) from the origin (0,0) to a given point \((a,b)\). Let \(L\) be the line joining the beginning to the end. For \(i= 0,1,\dots, a+ b-1\), let \(W_ i\) be the set of walks with ``exactly'' \(i\) points above and ``exactly'' \(a+ b+ 1- i\) points below \(L\). The authors show that it is possible to distribute the points on \(L\) in such a way that the sets \(W_ i\) are equinumerous.
    0 references
    0 references
    lattice path
    0 references
    counting
    0 references
    cycle lemma
    0 references
    planar walks
    0 references
    0 references
    0 references