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

Stanley's Major Contributions to Ehrhart Theory

This expository paper features a few highlights of Richard Stanley's extensive work in Ehrhart theory, the study of integer-point enumeration in rational polyhedra. We include results from the recent literature building on Stanley's work, as well as several open problems.Comment: 9 pages; to appear in the 70th-birthday volume honoring Richard Stanle

A Provably Stable Discontinuous Galerkin Spectral Element Approximation for Moving Hexahedral Meshes

We design a novel provably stable discontinuous Galerkin spectral element (DGSEM) approximation to solve systems of conservation laws on moving domains. To incorporate the motion of the domain, we use an arbitrary Lagrangian-Eulerian formulation to map the governing equations to a fixed reference domain. The approximation is made stable by a discretization of a skew-symmetric formulation of the problem. We prove that the discrete approximation is stable, conservative and, for constant coefficient problems, maintains the free-stream preservation property. We also provide details on how to add the new skew-symmetric ALE approximation to an existing discontinuous Galerkin spectral element code. Lastly, we provide numerical support of the theoretical results

Quantitative combinatorial geometry for continuous parameters

We prove variations of Carath\'eodory's, Helly's and Tverberg's theorems where the sets involved are measured according to continuous functions such as the volume or diameter. Among our results, we present continuous quantitative versions of Lov\'asz's colorful Helly theorem, B\'ar\'any's colorful Carath\'eodory's theorem, and the colorful Tverberg theorem.Comment: 22 pages. arXiv admin note: substantial text overlap with arXiv:1503.0611

Quantitative Tverberg, Helly, & Carath\'eodory theorems

This paper presents sixteen quantitative versions of the classic Tverberg, Helly, & Caratheodory theorems in combinatorial convexity. Our results include measurable or enumerable information in the hypothesis and the conclusion. Typical measurements include the volume, the diameter, or the number of points in a lattice.Comment: 33 page

A Polynomial Spectral Calculus for Analysis of DG Spectral Element Methods

We introduce a polynomial spectral calculus that follows from the summation by parts property of the Legendre-Gauss-Lobatto quadrature. We use the calculus to simplify the analysis of two multidimensional discontinuous Galerkin spectral element approximations