Tiling circular n-boards with squares and (1,1)-fences
math.CO
Submitted: 2026-10-29
Updated: 2026-10-29
Comments: 12 pages, 1 figure
License: http://creativecommons.org/licenses/by/4.0/
The gist: We show that the number of ways to tile a circular n-board (an annulus divided into n curved unit square cells) with appropriately curved unit squares and curved (1,1)-fences is a Lucas number…
Abstract
We show that the number of ways to tile a circular n-board (an annulus divided into n curved unit square cells) with appropriately curved unit squares and curved (1,1)-fences is a Lucas number squared if n is even and an odd-indexed Lucas number otherwise. A curved (1,1)-fence is composed of two curved unit squares separated by a gap in the shape of another curved unit square. This combinatorial interpretation of the Lucas numbers squared and the odd-indexed Lucas numbers allows us to obtain various identities concerning these sequences in a quick and lucid manner.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality