On pairs of lattice paths with a given number of intersections (Q1356026): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2034051839 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Counting pairs of lattice paths by intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Even and odd pairs of lattice paths with multiple intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonintersecting paths, pfaffians, and plane partitions / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:02, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On pairs of lattice paths with a given number of intersections |
scientific article |
Statements
On pairs of lattice paths with a given number of intersections (English)
0 references
9 November 1997
0 references
The author gives another proof for the number of ordered pairs of paths in the integer lattice \(\mathbb{Z}\times\mathbb{Z}\) with a prescribed number of intersection points. This is done by constructing a bijection algorithm between the set of these pairs and some combinatorial set generated by nonintersecting pairs. The first formula for the mentioned number was recently given by \textit{I. M. Gessel} and \textit{W. Shur} [J. Comb. Theory, Ser. A 75, No. 2, 243-253, Art. No. 0075 (1996; Zbl 0866.05002)]. In conclusion some complicated binomial identities are established.
0 references
lattice paths
0 references
intersection number
0 references
number of ordered pairs of paths
0 references
integer lattice
0 references
binomial identities
0 references