๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On Pairs of Lattice Paths with a Given Number of Intersections

โœ Scribed by Markus Fulmek

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
307 KB
Volume
78
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis

This formula was proved in [2] by means of generating functions.

2. INTERPRETATION OF THE FORMULA'S SUMMANDS

Our bijection is based on an appropriate lattice-path-interpretation for the formula's summands (pointed out by Krattenthaler [4]): Clearly, we article no. TA962754 154 0097-3165ร‚97 25.00

๐Ÿ“œ SIMILAR VOLUMES

Counting Pairs of Lattice Paths by Inter
Counting Pairs of Lattice Paths by Intersections
โœ Ira Gessel; Wayne Goddard; Walter Shur; Herbert S. Wilf; Lily Yen ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 377 KB

We count the pairs of walks between diagonally opposite corners of a given lattice rectangle by the number of points in which they intersect. We note that the number of such pairs with one intersection is twice the number with no intersection and we give a bijective proof of that fact. Some probabil

Even and Odd Pairs of Lattice Paths with
Even and Odd Pairs of Lattice Paths with Multiple Intersections
โœ Ira M. Gessel; Walter Shur ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 345 KB

We study the numbers M n, k r, s , N n, r k =M n, k r, r , N E (n, k, p), and N O (n, k, p), prove several simple relations among them, and derive a simpler formula for M n, k r, s than appears in .

On Number of Circles Intersected by a Li
On Number of Circles Intersected by a Line
โœ Lu Yang; Jingzhong Zhang; Weinian Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 394 KB
A Class of Hypergraph Arrangements with
A Class of Hypergraph Arrangements with Shellable Intersection Lattice
โœ Dmitry N. Kozlov ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

For every hypergraph on n vertices there is an associated subspace arrangement in R n called a hypergraph arrangement. We prove shellability for the intersection lattices of a large class of hypergraph arrangements. This class incorporates all the hypergraph arrangements which were previously shown

On local connectivity of graphs with giv
On local connectivity of graphs with given clique number
โœ Andreas Holtkamp; Lutz Volkmann ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 72 KB

## Abstract For a vertex __v__ of a graph __G__, we denote by __d__(__v__) the __degree__ of __v__. The __local connectivity__ ฮบ(__u, v__) of two vertices __u__ and __v__ in a graph __G__ is the maximum number of internally disjoint __u__ โ€“__v__ paths in __G__, and the __connectivity__ of __G__ is