Related papers: On two-toned tilings and $(m,n)$-words
Akhunzhanov and Shatskov defined the Dirichlet spectrum, corresponding to $m \times n$ matrices and to norms on $\mathbb{R}^m$ and $\mathbb{R}^n$. In case $(m,n) = (2,1)$ and using the Euclidean norm on $\mathbb{R}^2$, they showed that the…
In this paper we give a bijective proof for a relation between uni- bi- and tricellular maps of certain topological genus. While this relation can formally be obtained using Matrix-theory as a result of the Schwinger-Dyson equation, we here…
Similar to a tree grammar, a Horn theory can be used to describe an infinite set of terms. In this paper, we present a class of Horn theories such that the set of definable predicates is closed wrt. conjunction and such that the…
Plane perfect matchings of $2n$ points in convex position are in bijection with triangulations of convex polygons of size $n+2$. Edge flips are a classic operation to perform local changes both structures have in common. In this work, we…
We consider the structure of Pisot substitution tiling spaces, in particular, the structure of those spaces for which the translation action does not have pure discrete spectrum. Such a space is always a measurable m-to-one cover of an…
Pairs of metrics in a two-dimensional linear vector space are considered, one of which is a Minkowski type metric. Their simultaneous diagonalizability is studied and canonical presentations for them are suggested.
The Pak-Stanley labeling is a bijection between the regions of the $m$-Shi arrangement and the $m$-parking functions. Mazin generalized this labeling to every deformation of the braid arrangement and proved that this labeling is always…
In this paper, we give bijections between the set of 4123-avoiding down-up alternating permutations of length $2n$ and the set of standard Young tableaux of shape $(n,n,n)$, and between the set of 4123-avoiding down-up alternating…
Given a vertex colouring of the infinite $n$-ary Cantor tree with $m$ colours ($n,m\geq 2$), the natural problem arises: may this colouring induce a bijective colouring of the infinite paths starting at the root, i.e., that every infinite…
We introduce two operators on stable configurations of the sandpile model that provide an algorithmic bijection between recurrent and parking configurations. This bijection preserves their equivalence classes with respect to the sandpile…
In this note, we give a construction that provides a tight lower bound of mn-1 for the length of the shortest word in the intersection of two regular languages with state complexities m and n.
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
We generalize the notion of $m$-isometric operator tuples on Hilbert spaces in a natural way to normed spaces. This is done by defining a tuple analogue of $(m,p)$-isometric operators, so-called $(m,p)$-isometric operator tuples. We then…
We reinterpret N=(2,1) strings as describing the continuum limit of matrix theory with all spatial dimensions compactified. Thus they may characterize the full set of degrees of freedom needed to formulate the theory.
Linked partitions are introduced by Dykema in the study of transforms in free probability theory, whereas permutation tableaux are introduced by Steingr\'{i}msson and Williams in the study of totally positive Grassmannian cells. Let…
Motivated by the study of Fibonacci-like Wang shifts, we define a numeration system for $\mathbb{Z}$ and $\mathbb{Z}^2$ based on the binary alphabet $\{0,1\}$. We introduce a set of 16 Wang tiles that admits a valid tiling of the plane…
We consider a class of cut-and-project sets $\Lambda = \Lambda_F \times \zahl$ in the plane. Let $L=\Lambda+w\real$, $w\in\real^2$, be a countable union of parallel lines. Then either (1) $L$ is a discrete family of lines, (2) $L$ is a…
Let $\mathcal{C}$ be a triangulated category with shift functor $[1]$ and $\mathcal{R}$ a rigid subcategory of $\mathcal{C}$. We introduce the notions of two-term $\mathcal{R}[1]$-rigid subcategories, two-term (weak)…
Bipartite graph tiling was studied by Zhao who gave the best possible minimum degree conditions for a balanced bipartite graph on 2ms vertices to contain m vertex disjoint copies of K_{s,s}. Let s<t be fixed positive integers. Hladk\'y and…
We define sets of coulourings of the infinite discrete plane using monadic second order (MSO) formulas. We determine the complexity of deciding whether such a formula defines a subshift, parametrized on the quantifier alternation complexity…