Skip to main content
Article
A Note on Lattice Chains and Delannoy Numbers
Discrete Mathematics (2008)
  • John S Caughman, IV, Portland State University
  • Clifford R. Haithcock, Portland State University
  • J. J. P. Veerman, Portland State University
Abstract
Fix nonnegative integers and let L denote the lattice of integer points satisfying for . Let L be partially ordered by the usual dominance ordering. In this paper we offer combinatorial derivations of a number of results concerning chains in L. In particular, the results obtained are established without recourse to generating functions or recurrence relations. We begin with an elementary derivation of the number of chains in L of a given size, from which one can deduce the classical expression for the total number of chains in L. Then we derive a second, alternative, expression for the total number of chains in L when . Setting in this expression yields a new proof of a result of Stanley [Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999] relating the total number of chains to the central Delannoy numbers. We also conjecture a generalization of Stanley''s result to higher dimensions.
Publication Date
June, 2008
Citation Information
John S Caughman, Clifford R. Haithcock and J. J. P. Veerman. "A Note on Lattice Chains and Delannoy Numbers" Discrete Mathematics Vol. 308 Iss. 12 (2008)
Available at: http://works.bepress.com/jj-veerman/43/