Why Delannoy numbers?

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.Comment: Presented to the conference "Lattice Paths Combinatorics and Discrete Distributions" (Athens, June 5-7, 2002) and to appear in the Journal of Statistical Planning and Inference

Missing Elements and Missing Premises: A Combinatorial Argument for the Ontological Reduction of Chemistry

Does chemistry reduce to physics? If this means Can we derive the laws of chemistry from the laws of physics?', recent discussions suggest that the answer is no'. But sup posing that kind of reduction-- epistemological reduction'--to be impossible, the thesis of ontological reduction may still be true: that chemical properties are determined by more fundamental properties. However, even this thesis is threatened by some objections to the physicalist programme in the philosophy of mind, objections that generalize to the chemical case. Two objections are discussed: that physicalism is vacuous, and that nothing grounds the asymmetry of dependence which reductionism requires. Although it might seem rather surprising that the philosophy of chemistry is affected by shock waves from debates in the philosophy of mind, these objections show that there is an argumentative gap between, on the one hand, the theoretical connection linking chemical properties with properties at the sub-atomic level, and, on the other, the philosophical thesis of ontological reduction. The aim of this paper is to identify the missing premises (among them a theory of physical possibility) that would bridge this gap. Introduction: missing elements and the mystery of discreteness The refutation of physicalism A combinatorial theory of physical possibilia Combinatorialism and the Bohr model Objections The missing premises and a disanalogy with min

Note on Ward-Horadam H(x) - binomials' recurrences and related interpretations, II

We deliver here second new $\textit{H(x)}-binomials'$ recurrence formula, were $H(x)-binomials'$ array is appointed by $Ward-Horadam$ sequence of functions which in predominantly considered cases where chosen to be polynomials . Secondly, we supply a review of selected related combinatorial interpretations of generalized binomial coefficients. We then propose also a kind of transfer of interpretation of $p,q-binomial$ coefficients onto $q-binomial$ coefficients interpretations thus bringing us back to $Gy{\"{o}}rgy P\'olya$ and Donald Ervin Knuth relevant investigation decades ago.Comment: 57 pages, 8 figure

Statistics on Graphs, Exponential Formula and Combinatorial Physics

The concern of this paper is a famous combinatorial formula known under the name "exponential formula". It occurs quite naturally in many contexts (physics, mathematics, computer science). Roughly speaking, it expresses that the exponential generating function of a whole structure is equal to the exponential of those of connected substructures. Keeping this descriptive statement as a guideline, we develop a general framework to handle many different situations in which the exponential formula can be applied

On the expected number of perfect matchings in cubic planar graphs

A well-known conjecture by Lov\'asz and Plummer from the 1970s asserted that a bridgeless cubic graph has exponentially many perfect matchings. It was solved in the affirmative by Esperet et al. (Adv. Math. 2011). On the other hand, Chudnovsky and Seymour (Combinatorica 2012) proved the conjecture in the special case of cubic planar graphs. In our work we consider random bridgeless cubic planar graphs with the uniform distribution on graphs with $n$ vertices. Under this model we show that the expected number of perfect matchings in labeled bridgeless cubic planar graphs is asymptotically $c\gamma^n$, where $c>0$ and $\gamma \sim 1.14196$ is an explicit algebraic number. We also compute the expected number of perfect matchings in (non necessarily bridgeless) cubic planar graphs and provide lower bounds for unlabeled graphs. Our starting point is a correspondence between counting perfect matchings in rooted cubic planar maps and the partition function of the Ising model in rooted triangulations.Comment: 19 pages, 4 figure