Related papers: $SL_k$-Tilings and Paths in $\mathbb{Z}^k$

In this paper we study ideas which have proved useful in topological network theory in the context of lattices of numbers. A number lattice $L_S$ is a collection of row vectors, over $\mathbb{Q}$ on a finite column set $S,$ generated by…

We say that a function $f \in L^1(\mathbb{R})$ tiles at level $w$ by a discrete translation set $\Lambda \subset \mathbb{R}$, if we have $\sum_{\lambda \in \Lambda} f(x-\lambda)=w$ a.e. In this paper we survey the main results, and prove…

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…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

The Graph Minors Series of Robertson and Seymour forms the foundation of algorithmic structural graph theory, yielding fixed-parameter algorithms for problems such as Disjoint Paths, Rooted Minor Checking, and Folio. A key ingredient behind…

We use Fourier methods to prove that if $n > 1$ translates of sublattices of $Z^d$ tile $Z^d$, and all the sublattices are Cartesian products of arithmetic progressions, then two of the tiles must be translates of each other. This is a…

We study the skew-symmetric prolongation of a Lie subalgebra $\g \subseteq \mathfrak{so}(n)$, in other words the intersection $\Lambda^3 \cap (\Lambda^1 \otimes \g)$.We compute this space in full generality. Applications include uniqueness…

This paper investigates lozenge tilings of non-convex hexagonal regions and more specifically the asymptotic fluctuations of the tilings within and near the strip formed by opposite cuts in the regions, when the size of the regions tend to…

We study square-tiled tori, that is, tori obtained from a finite collection of unit squares by parallel side identifications. Square-tiled tori can be parametrized in a natural way that allows to count the number of square-tiled tori tiled…

We show that for any permutation $\pi$ there exists an integer $k_{\pi}$ such that every permutation avoiding $\pi$ as a pattern is a product of at most $k_{\pi}$ separable permutations. In other words, every strict class $\mathcal C$ of…

We prove that Kellendonk's $C^*$-algebra of an aperiodic and repetitive tiling with finite local complexity is classifiable by the Elliott invariant. Our result follows from showing that tiling $C^*$-algebras are $\mathcal{Z}$-stable, and…

A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…

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…

Consider a periodic tiling of a plane by equal triangles obtained from the equilateral tiling by a linear transformation. We study a following tiling billiard: a ball follows straight segments and bounces of the boundaries of the tiles into…

Suppose $\lambda$ and $\mu$ are integer partitions with $\lambda\supseteq\mu$. Kenyon and Wilson have introduced the notion of a cover-inclusive Dyck tiling of the skew Young diagram $\lambda\setminus\mu$, which has applications in the…

Working over a field $k$ of characteristic zero, we study the ring $\mathfrak{R}=\mathfrak{D}^{\mathbb{Z}_2}$ where $\mathfrak{D}=k[x_0,x_1,x_2]/(2x_0x_2-x_1^2-1)$ and $\mathbb{Z}_2$ acts by $x_i\to -x_i$. $\mathfrak{D}$ admits an algebraic…

The Algebraic Kirchberg-Phillips Question for Leavitt path algebras asks whether unital $K$-theory is a complete isomorphism invariant for unital, simple, purely infinite Leavitt path algebras over finite graphs. Most work on this problem…

A digraph $D$ is $k$-linked if for every $2k$-tuple $ x_1,\ldots , x_k, y_1, \ldots , y_k$ of distinct vertices in $D$, there exist $k$ pairwise vertex-disjoint paths $P_1,\ldots, P_k$ such that $P_i$ starts at $x_i$ and ends at $y_i$,…

It was shown by Gruslys, Leader and Tan that any finite subset of $\mathbb{Z}^n$ tiles $\mathbb{Z}^d$ for some $d$. The first non-trivial case is the punctured interval, which consists of the interval $\{-k,\ldots,k\} \subset \mathbb{Z}$…

For positive integers $k, l \geq 2$, the set of $k$-regular partitions in which parts appear at most $l$ times has attracted a lot of interest in that a composition of Glaisher's mapping can be used to prove the associated partition…