Even and odd pairs of lattice paths with multiple intersections (Q1924223): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcta.1996.0075 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973664285 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.7714 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCTA.1996.0075 / rank
 
Normal rank

Latest revision as of 12:59, 16 December 2024

scientific article
Language Label Description Also known as
English
Even and odd pairs of lattice paths with multiple intersections
scientific article

    Statements

    Even and odd pairs of lattice paths with multiple intersections (English)
    0 references
    0 references
    0 references
    25 June 1997
    0 references
    Let \(M_{r,s}^{n,k}\) be the number of ordered pairs of plain lattice paths, with unit steps \(E\) and \(N,\) such that the first path ends at \((r,n-r),\) the second ends at \((k,n-k)\) and they have \(k\) intersections. Let \(N_E\) (\(N_O\)) denote the total numbers of pairs with even (odd) \(r+s.\) The paper proves simple relations among these (and related) quantities and determines a simpler exact formula for \(M_{r,s}^{n,k}.\)
    0 references
    generating function
    0 references
    enumeration
    0 references
    lattice paths
    0 references

    Identifiers