相关论文: Weak colored local rules for planar tilings

We consider a problem concerning tilings of rectangular regions by a finite library of polyominoes. We specifically look at rectangular regions of dimension $n\times m$ and ask whether or not a tiling of this region can be rearranged so…

A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…

Boolean locales are "almost discrete", in the sense that a spatial Boolean locale is just a discrete locale (that is, it corresponds to the frame of open subsets of a discrete space, namely the powerset of a set). This basic fact, however,…

Consider a classification problem where we do not have access to labels for individual training examples, but only have average labels over subpopulations. We give practical examples of this setup and show how such a classification task can…

We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…

The celebrated Time Hierarchy Theorem for Turing machines states, informally, that more problems can be solved given more time. The extent to which a time hierarchy-type theorem holds in the distributed LOCAL model has been open for many…

A graph is called 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we establish a local property of 1-planar graphs which describes the structure in the neighborhood of small…

The attempts to prove the Four Color Problem last for long years. A little hope arises that the properties of the minimal partial triangulations will be very useful for the solution of the Four Color Problem. That is why the material of…

Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…

We study connections between distributed local algorithms, finitary factors of iid processes, and descriptive combinatorics in the context of regular trees. We extend the Borel determinacy technique of Marks coming from descriptive…

In this paper, based on the contributions of Tucker (1983) and Seb{\H{o}} (1992), we generalize the concept of a sequential coloring of a graph to a framework in which the algorithm may use a coloring rule-base obtained from suitable…

When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a…

In this paper, a weak Local Linearization scheme for Stochastic Differential Equations (SDEs) with multiplicative noise is introduced. First, for a time discretization, the solution of the SDE is locally approximated by the solution of the…

Sparse linear regression with ill-conditioned Gaussian random designs is widely believed to exhibit a statistical/computational gap, but there is surprisingly little formal evidence for this belief, even in the form of examples that are…

Minimal linear codes have interesting applications in secret sharing schemes and secure two-party computation. This paper uses characteristic functions of some subsets of $\mathbb{F}_q$ to construct minimal linear codes. By properties of…

We focus on erasure codes for distributed storage. The distributed storage setting imposes locality requirements because of easy repair demands on the decoder. We first establish the characterization of various locality properties in terms…

We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…

The question of what can be computed, and how efficiently, are at the core of computer science. Not surprisingly, in distributed systems and networking research, an equally fundamental question is what can be computed in a…

The notion of weak tiling was a key ingredient in the proof of Fuglede's spectral set conjecture for convex bodies \cite{conv}, due to the fact that every spectral set tiles its complement weakly with a suitable Borel measure. In this paper…

In this article, we give a few examples of local rings in relation to weak normality and seminormality in mixed characteristic. It is known that two concepts can differ in the equal prime characteristic case, while they coincide in the…