pith. sign in

arxiv: math/0411128 · v1 · pith:GYAYNFTZnew · submitted 2004-11-06 · 🧮 math.CO · cs.DS· cs.GT· math.HO· math.PR· math.ST· q-bio.GN· stat.TH

Why Delannoy numbers?

classification 🧮 math.CO cs.DScs.GTmath.HOmath.PRmath.STq-bio.GNstat.TH
keywords delannoynumbersproblemsworksalgorithmsalignmentsanalysisanswers
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.