相关论文: A new combinatorial interpretation of the Fibonacc…
The Brattelli diagram associated with a given bicolored Dynkin-Coxeter graph of type $A_n$ determines planar fractal sets obtained by infinite dissections of a given triangle. All triangles appearing in the dissection process have angles…
Consider a $2\times n$ rectangular grid composed of $1\times 1$ squares. Cutting only along the edges between squares, how many ways are there to divide the board into $k$ pieces? Building off the work of Durham and Richmond, who found the…
This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…
A (general) polygonal line tiling is a graph formed by a string of cycles, each intersecting the previous at an edge, no three intersecting. In 2022, Matsushita proved the matching complex of a certain type of polygonal line tiling with…
We develop a multifractal random tilling that fills the square. The multifractal is formed by an arrangement of rectangular blocks of different sizes, areas and number of neighbors. The overall feature of the tilling is an heterogeneous and…
We consider incomplete tilings of the equilateral triangle of edge length n that is subdivided into n^2 regular equilateral smaller unit triangles. Pairs of the unit triangles that share a side may be converted into lozenges, leaving some…
We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…
It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right…
What is the maximum number of holes enclosed by a $d$-dimensional polyomino built of $n$ tiles? Represent this number by $f_d(n)$. Recent results show that $f_2(n)/n$ converges to $1/2$. We prove that for all $d \geq 2$ we have $f_d(n)/n…
An N -tiling of triangle ABC by triangle T is a way of writing ABC as a union of N triangles congruent to T, overlapping only at their boundaries. The triangle T is the "tile". The tile may or may not be similar to ABC . We wish to…
The pinwheel triangle of Conway and Radin is a standard example for tilings with self-similarity and statistical circular symmetry. Many modifications were constructed, all based on partitions of triangles or rectangles. The fractal example…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
An $n$-dimensional cross comprises $2n+1$ unit cubes: the center cube and reflections in all its faces. It is well known that there is a tiling of $R^{n}$ by crosses for all $n.$ AlBdaiwi and the first author proved that if $2n+1$ is not a…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. We develop the algorithm for finding all the tilings for fixed number of tiles and present the calculation for tilings of surfaces of small…
There are exactly eight edge-to-edge tilings of the sphere by congruent equilateral pentagons: three pentagonal subdivision tilings with 12, 24, 60 tiles; four earth map tilings with 16, 20, 24, 24 tiles; and one flip modification of the…
We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of…
Consider a plane branch, that is, an irreducible germ of curve on a smooth complex analytic surface. We define its blow-up complexity as the number of blow-ups of points necessary to achieve its minimal embedded resolution. We show that…
The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…
The object under study is a particular closed curve on the square lattice $\Z^2$ related with the Fibonacci sequence $F_n$. It belongs to a class of curves whose length is $4F_{3n+1}$, and whose interiors by translation tile the plane. The…