Related papers: Weak colored local rules for planar tilings

Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n, k, d] code having all-symbol (r, \delta})-locality, denoted as (r, {\delta})a, is considered optimal if it also meets the minimum…

We present a relatively simple description of binary, definable subsets of models of weakly quasi-o-minimal theories. In particular, we closely describe definable linear orders and prove a weak version of the monotonicity theorem. We also…

Minimal linear codes have significant applications in secret sharing schemes and secure two-party computation. There are several methods to construct linear codes, one of which is based on functions over finite fields. Recently, many…

We prove that sparse string graphs in a fixed surface have linear expansion. We extend this result to the more general setting of sparse region intersection graphs over any proper minor-closed class. The proofs are combinatorial and…

The weak variant of Hanani-Tutte theorem says that a graph is planar, if it can be drawn in the plane so that every pair of edges cross an even number of times. Moreover, we can turn such a drawing into an embedding without changing the…

A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations $E$ there is a threshold value $R_k(E)$ (the Rado number of $E$) such that for any $k$-coloring of the integers in the interval $[1,n]$, with $n \ge…

In this note we study the local negativity for certain configurations of smooth rational curves in smooth surfaces with numerically trivial canonical class. We show that for such rational curves there is a bound for the so-called local…

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

We obtain structural results on translational tilings of periodic functions in $\mathbb{Z}^d$ by finite tiles. In particular, we show that any level one tiling of a periodic set in $\mathbb{Z}^2$ must be weakly periodic (the disjoint union…

A function $f:X\to Y$ between topological spaces is said to be a {\it weakly Gibson function} if $f(\overline{U})\subseteq \overline{f(U)}$ for any open connected set \mbox{$U\subseteq X$}. We prove that if $X$ is a locally connected…

A $k$-coloring of a graph $G=(V,E)$ is called semi-equitable if there exists a partition of its vertex set into independent subsets $V_1,\ldots,V_k$ in such a way that $|V_1| \notin \{\lceil |V|/k\rceil, \lfloor |V|/k \rfloor\}$ and…

A set $\Omega \subset \mathbb{R}^d$ is said to be spectral if the space $L^2(\Omega)$ admits an orthogonal basis of exponential functions. Fuglede (1974) conjectured that $\Omega$ is spectral if and only if it can tile the space by…

Several old and recent classes of picture grammars, that variously extend context-free string grammars in two dimensions, are based on rules that rewrite arrays of pixels. Such grammars can be unified and extended using a tiling based…

A proper vertex coloring of a graph is equitable if the sizes of all color classes differ by at most $1$. For a list assignment $L$ of $k$ colors to each vertex of an $n$-vertex graph $G$, an equitable $L$-coloring of $G$ is a proper…

Generalizing the notion of odd-sum colorings, a $\mathbb{Z}$-labeling of a graph $G$ is called a closed coloring with remainder $k\mod n$ if the closed neighborhood label sum of each vertex is congruent to $k\mod n$. If such colorings…

We investigate the connections between the fields of distributed computing and measurable combinatorics by considering complexity classes of locally checkable labeling problems on regular forests. We show that the most important…

In this paper, we demonstrate the existence of positive solutions for certain weakly coupled elliptic systems of sublinear growth under homogeneous Dirichlet boundary conditions. Our findings generalize existing results related to sublinear…

If most of the pixels in an $n \times m$ digital image are the same color, must the image contain a large connected component? How densely can a given set of connected components pack in $\mathbb{Z}^2$ without touching? We answer these two…

We construct cryptographic trilinear maps that involve simple, non-ordinary abelian varieties over finite fields. In addition to the discrete logarithm problems on the abelian varieties, the cryptographic strength of the trilinear maps is…

We resolve a number of long-standing open problems in online graph coloring. More specifically, we develop tight lower bounds on the performance of online algorithms for fundamental graph classes. An important contribution is that our…