| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
28 March 2024 |
|
| | | |
|
Article overview
| |
|
Why Delannoy numbers? | Cyril Banderier
; Sylviane Schwer
; | Date: |
6 Nov 2004 | Subject: | Combinatorics; Probability; History and Overview; Statistics; Data Structures and Algorithms; Computer Science and Game Theory; Genomics | math.CO cs.DS cs.GT math.HO math.PR math.ST q-bio.GN | Affiliation: | LIPN), Sylviane Schwer (LIPN | Abstract: | This article is not a research paper, but a little note on the history of combinatorics: We present here a tentative short biography of Henri Delannoy, and a survey of his most notable works. This answers to 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. These numbers appear in probabilistic game theory, alignments of DNA sequences, tiling problems, temporal representation models, analysis of algorithms and combinatorial structures. | Source: | arXiv, math.CO/0411128 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |