
A set of natural numbers tiles the plane if a square-tiling of the plane exists using exactly one square of side length n for every n in the set. In [9] it is shown that N, the set of all natural numbers, tiles the plane. We answer here a number of questions from that paper. We show that there is a simple tiling of the plane (no nontrivial subset of squares forms a rectangle). We show that neither the odd numbers nor the prime numbers tile the plane. We show that N can tile many, even infinitely many planes.
Let
In the paper, utilizing respectively the induction, a generating function of the Lah numbers, the Chu-Vandermonde summation formula, an inversion formula, the Gauss hypergeometric series, and two generating functions of Stirling numbers of the first kind, the authors collect and provide six proofs for an identity of the Lah numbers.
We prove that if
where
The proof relies on a result in
where
By extending former results of Ehrhart, it was shown by Peter McMullen that the number of lattice points in the Minkowski-sum of dilated rational polytopes is a quasipolynomial function in the dilation factors. Here we take a closer look at the coefficients of these quasi-polynomials and show that they are piecewise polynomials themselves and that they are related to each other by a simple differential equation. As a corollary, we obtain a refinement of former results on lattice points in vector dilated polytopes
Using the Saddle point method and multiseries expansions, we obtain from the generating function of the Eulerian numbers
1970-2025 CP (Manitoba, Canada) unless otherwise stated.