相关论文: Ribbon Tilings and Multidimensional Height Functio…
We construct a unilateral lattice tiling of $\mathbb{R}^n$ into hypercubes of two differnet side lengths $p$ or $q$. This generalizes the Pythagorean tiling in $\mathbb{R}^2$. We also show that this tiling is unique up to symmetries, which…
Given a vertex-colored graph, we say a path is a rainbow vertex path if all its internal vertices have distinct colors. The graph is rainbow vertex-connected if there is a rainbow vertex path between every pair of its vertices. In the…
Let a polygon be composed of equal rectangles. We find all quadratic irrationals r for which the polygon can be tiled by similar rectangles with given side ratio r.
An edge-colored multigraph $G$ is rainbow connected if every pair of vertices is joined by at least one rainbow path, i.e., a path where no two edges are of the same color. In the context of multilayered networks we introduce the notion of…
We consider the problem of counting the number of possible sets of rankings (called ranking patterns) generated by unfolding models of codimension one. We express the ranking patterns as slices of the braid arrangement and show that all…
Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…
Given a graph, does there exist an orientation of the edges such that the resulting directed graph is strongly connected? Robbins' theorem [Robbins, Am. Math. Monthly, 1939] states that such an orientation exists if and only if the graph is…
In this paper, we give some sufficient conditions for a $n$-dimensional rectangle to be tiled with a set of bricks. These conditions are obtained by using the so-called Frobenius number.
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…
Twists are defects that are used to encode and process quantum information in topological codes like surface and color codes. Color codes can host three basic types of twists viz., charge-permuting, color-permuting and domino twists. In…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
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…
For a fixed integer h>=1, let G be a tripartite graph with N vertices in each vertex class, N divisible by 6h, such that every vertex is adjacent to at least 2N/3+h-1 vertices in each of the other classes. We show that if N is sufficiently…
A two-dimensional \emph{grid} is a set $\Gnm = [n]\times[m]$. A grid $\Gnm$ is \emph{$c$-colorable} if there is a function $\chi_{n,m}: \Gnm \to [c]$ such that there are no rectangles with all four corners the same color. We address the…
We prove that for any $r\in \mathbb{N}$, there exists a constant $C_r$ such that the following is true. Let $\mathcal{F}=\{F_1,F_2,\dots\}$ be an infinite sequence of bipartite graphs such that $|V(F_i)|=i$ and $\Delta(F_i)\leq \Delta$ hold…
Recently, Greenfeld and Tao disprove the conjecture that translational tilings of a single tile can always be periodic [Ann. Math. 200(2024), 301-363]. In another paper [to appear in J. Eur. Math. Soc.], they also show that if the dimension…
A tiling of the $n$-dimensional Hamming cube gives rise to a perfect code (according to a given metric) if the basic tile is a metric ball. We are concerned with metrics on the $n$-dimensional Hamming cube which are determined by a weight…
We analyze asymptotic height function fluctuations in uniformly random domino tiling models on multiply connected Temperleyan domains. Starting from asymptotic formulas derived by Kenyon [arXiv:math-ph/9910002v1], we show that (1) the…
Consider a line segment placed on a two-dimensional grid of rectangular tiles. This paper addresses the relationship between the length of the segment and the number of tiles it visits (i.e. has intersection with). The square grid is also…
This article examines the tilings of a strip with equilateral triangles. The number of ways in which the lattices can be covered with a combination of tiles of the two types of triangles is related to Pell's numbers. Additionally, the…