Abstract | ||
---|---|---|
Let G(n) denote the set of lattice paths from (0,0) to (n,n) with steps of the form (i,j) where i and j are nonnegative integers, not both zero. Let D-n denote the set of paths in G(n) with steps restricted to (1,0), (0,1), (1,1), the so-called Delannoy paths. Stanley has shown that \G(n)\ = 2(n-1)\D-n\ and Sulanke has given a bijective proof. Here we give a simple statistic on G(n) that is uniformly distributed over the s(n-1) subsets of [n-1] = {1,2,...,n} and takes the value [n-1] precisely on the Delannoy paths. |
Year | Venue | Field |
---|---|---|
2004 | ELECTRONIC JOURNAL OF COMBINATORICS | Integer,Discrete mathematics,Combinatorics,Statistic,Lattice (order),Bijective proof,Mathematics |
DocType | Volume | Issue |
Journal | 11 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
3 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
David Callan | 1 | 7 | 5.50 |