Related papers: Identities involving the tribonacci numbers square…
Translational tiling problems are among the most fundamental and representative undecidable problems in all fields of mathematics. Greenfeld and Tao obtained two remarkable results on the undecidability of translational tiling in recent…
We show how we found substitution rules for a quasiperiodic tiling with local rotational symmetry and inflation factor 1 + sqrt(3). The base tiles are a square, a rhomb with an acute angle of 30 degrees, and equilateral triangles that are…
In this paper we study colorings (or tilings) of the two-dimensional grid $\mathbb{Z}^2$. A coloring is said to be valid with respect to a set $P$ of $n\times m$ rectangular patterns if all $n\times m$ sub-patterns of the coloring are in…
The combinatorics of tilings of a hexagon of integer side-length $n$ by 120 degree - 60 degree diamonds of side-length 1 has a long history, both directly (as a problem of interest in thermodynamic models) and indirectly (through the…
Let $S$ be a set of arbitrary objects, and let $S^d=\{v_1...v_d\colon v_i\in S\}$. A polybox code is a set $V\subset S^d$ with the property that for every two words $v,w\in V$ there is $i\in [d]$ with $v_i'=w_i$, where a permutation…
We study the minimal complexity of tilings of a plane with a given tile set. We note that every tile set admits either no tiling or some tiling with O(n) Kolmogorov complexity of its n-by-n squares. We construct tile sets for which this…
We classify the periodic digit strings which arise from periodic billiard orbits on the four convex $n$-gons $\Delta$ which tile $\mathbb{R}^2$ under reflection, answering problem a posed by Baxter and Umble. $\Delta$ is either an…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
In this paper, we present a new approach to the convolved Fibonacci numbers arising from the generating function of them and give some new and explicit identities for the convolved Fibonacci numbers.
Let n integer greater or equal to 4 and even and let T_n be the set of ribbon L-shaped n-ominoes. We study tiling problems for regions in a square lattice by T_n. Our main result shows a remarkable rigidity property: a tiling of the first…
We show how to determine if a given simple rectilinear polygon can be tiled with rectangles, each having an integer side.
We construct via usual graph theory a class of associative dialgebras as well as a class of coassociative L-coalgebras. Tiling of the (n^2,1)-De bruijn graphs are also obtained and constructions of cubical trialgebras, (notion defined by…
We wish to tile a rectangle or a torus with only vertical and horizontal bars of a given length, such that the number of bars in every column and row equals given numbers. We present results for particular instances and for a more general…
The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very…
In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors…
In 1989, Ming Luo \cite{L2} showed that the Fibonacci number $U_n$ is Triangular if and only if $n=\pm1,2,4,8,10$. For this, he established a Jacobi Symbol Criterion. Moreover, he observed that this problem is equivalent to finding all…
For each positive integer n greater than or equal to 2, a new approach to expressing real numbers as sequences of nonnegative integers is given. The n=2 case is equivalent to the standard continued fraction algorithm. For n=3, it reduces to…
There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant.…
The top of the attractor $A$ of a hyperbolic iterated function system $\left\{ f_{i}:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}|i=1,2,\dots,M\right\} $ is defined and used to extend self-similar tilings to overlapping systems. The theory…
I discuss a variety of results involving s(n), the number of representations of n as a sum of three squares. One of my objectives is to reveal numerous interesting connections between the properties of this function and certain modular…