Related papers: Weak colored local rules for planar tilings
Several articles deal with tilings with squares and dominoes on 2-dimensional boards, but only a few on boards in 3-dimensional space. We examine a tiling problem with colored cubes and bricks of $(2\times2\times n)$-board in three…
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…
The Wang tiling is a classical problem in combinatorics. A major theoretical question is to find a (small) set of tiles which tiles the plane only aperiodically. In this case, resulting tilings are rather restrictive. On the other hand,…
In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the…
In this paper, we consider distributed coloring for planar graphs with a small number of colors. We present an optimal (up to a constant factor) $O(\log{n})$ time algorithm for 6-coloring planar graphs. Our algorithm is based on a novel…
In this paper it is proved that there exist periodic monohedral tilings and finite seeds of colored tiles, which force non-periodic coloring of the whole plane
Let $F$ be an ordered topological vector space (over $\mathbb{R}$) whose positive cone $F_+$ is weakly closed, and let $E \subseteq F$ be a subspace. We prove that the set of positive continuous linear functionals on $E$ that can be…
Clustering a signed graph means partitioning the vertices into sets ("clusters") so that every positive edge, and no negative edge, is within a cluster. Clustering is not always possible; the obstruction is circles with exactly one negative…
We show cocycle stability for linear maps with a weak irreducibility condition and their jointly integrable perturbations.
We introduce a new class of "random" subsets of natural numbers, WM sets. This class contains normal sets (sets whose characteristic function is a normal binary sequence). We establish necessary and sufficient conditions for solvability of…
In this work we study local computation with advice: the goal is to solve a graph problem $\Pi$ with a distributed algorithm in $T(\Delta)$ communication rounds, for some function $T$ that only depends on the maximum degree $\Delta$ of the…
We look at colourings of $r$-uniform hypergraphs, focusing our attention on unique colourability and gaps in the chromatic spectrum. The pattern of an edge $E$ in an $r$-uniform hypergraph $H$ whose vertices are coloured is the partition of…
A subset V of GF(2)^n is a tile if GF(2)^n can be covered by disjoint translates of V. In other words, V is a tile if and only if there is a subset A of GF(2)^n such that V+A = GF(2)^n uniquely (i.e., v + a = v' + a' implies that v=v' and…
An $n$-vertex graph is equitably $k$-colorable if there is a proper coloring of its vertices such that each color is used either $\left\lfloor n/k \right\rfloor$ or $\left\lceil n/k \right\rceil$ times. While classic Vertex Coloring is…
The weak $r$-coloring numbers $wcol_r(G)$ of a graph $G$ were introduced by the first two authors as a generalization of the usual coloring number $col(G)$, and have since found interesting theoretical and algorithmic applications. This has…
Weak diameter coloring of graphs recently attracted attention partially due to its connection to asymptotic dimension of metric spaces. We consider weak diameter list-coloring of graphs in this paper. Dvo\v{r}\'{a}k and Norin proved that…
A countable structure is indivisible if for every coloring with finite range there is a monochromatic isomorphic subcopy of the structure. Each indivisible structure naturally corresponds to an indivisibility problem which outputs such a…
We study the local properties of Artin stacks and their good moduli spaces, if they exist. We show that near closed points with linearly reductive stabilizer, Artin stacks formally locally admit good moduli spaces. We also give conditions…
A \emph{mixed graph} is a graph with directed edges, called arcs, and undirected edges. A $k$-coloring of the vertices is proper if colors from ${1,2,...,k}$ are assigned to each vertex such that $u$ and $v$ have different colors if $uv$ is…
Let $G$ be the fundamental group of a finite graph of groups with Noetherian edges and locally tame vertices. We prove that $G$ is locally tame. It follows that if a finitely presented group $H$ has a non-trivial $JSJ$-decomposition over…