Why Delannoy numbers?

被引：85
作者：
Banderier, C [1 ]
Schwer, S [1 ]
机构：
[1] Univ Paris 13, LIPN, UMR 7030, F-93430 Villetaneuse, France
来源：
JOURNAL OF STATISTICAL PLANNING AND INFERENCE | 2005年 / 135卷 / 01期
关键词：
lattice paths enumeration; ballot problems;
D O I：
10.1016/j.jspi.2005.02.004
中图分类号：
O21 [概率论与数理统计]; C8 [统计学];
学科分类号：
020208 ; 070103 ; 0714 ;
摘要：
This article is not a research paper, but a little note on the history of combinatories: we present here a tentative short biography of Henri Delannoy, and a survey of his most notable works,This answers, the question raised in the title, as these works are related to lattice paths enumeration to the so-called Delannoy numbers, and were the first general way to solve Ballot-like problems. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码：40 / 54
页数：15
相关论文
共 86 条
  • [1] Aeppli A., 1923, ENSEIGN MATH, V23, P328
  • [2] Andr? D., 1887, CR HEBD ACAD SCI, V105, P436
  • [3] [Anonymous], P CAMBRIDGE PHILOS S
  • [4] [Anonymous], 1970, ANAL COMBINATOIRE
  • [5] [Anonymous], MATH GAZETTE
  • [6] On generalized Delannoy paths
    Autebert, JM
    Schwer, SR
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2003, 16 (02) : 208 - 223
  • [7] Lattice of Delannoy paths
    Autebert, JM
    Latapy, M
    Schwer, SR
    [J]. DISCRETE MATHEMATICS, 2002, 258 (1-3) : 225 - 234
  • [8] AUTEBERT JM, 2004, GAZETTE MATH, V95, P51
  • [9] AUTORDE F, 1915, MEMORIES SSNAC, V19, P552
  • [10] Basic analytic combinatorics of directed lattice paths
    Banderier, C
    Flajolet, P
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 281 (1-2) : 37 - 80
123456789