Related papers: On the Parity Problem in One-Dimensional Cellular …
Parity word automata and their determinisation play an important role in automata and game theory. We discuss a determinisation procedure for nondeterministic parity automata through deterministic Rabin to deterministic parity automata. We…
Previous study of cellular automata and random Boolean networks has shown emergent behavior occurring at the edge of chaos where the randomness (disorder) of internal connections is set to an intermediate critical value. The value at which…
Recently, perfect matching in bounded planar cutwidth bipartite graphs (\BGGM) was shown to be in ACC$^0$ by Hansen et al.. They also conjectured that the problem is in AC$^0$. In this paper, we disprove their conjecture by showing that the…
Cellular automata are topological dynamical systems. We consider the problem of deciding whether two cellular automata are conjugate or not. We also consider deciding strong conjugacy, that is, conjugacy by a map that commutes with the…
We consider one dimensional lattice gauge theories constructed by the minimal coupling prescription. It is shown that these theories are exactly solvable in the thermodynamic limit. After considering the most general case, we discuss some…
In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…
Recent years, several new types of codes were introduced to provide fault-tolerance and guarantee system reliability in distributed storage systems, among which locally repairable codes (LRCs for short) have played an important role. A…
Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…
The l1-regularization is very popular in high dimensional statistics -- it changes a combinatorial problem of choosing which subset of the parameter are zero, into a simple continuous optimization. Using a continuous prior concentrated near…
The school choice problem concerns the design and implementation of matching mechanisms that produce school assignments for students within a given public school district. Previously considered criteria for evaluating proposed mechanisms…
A $q$-ary $(n,k,r)$ locally repairable code (LRC) is an $[n,k,d]$ linear code over $\mathbb{F}_q$ such that every code symbol can be recovered by accessing at most $r$ other code symbols. The well-known Singleton-like bound says that $d \le…
Analysis sparsity is a common prior in inverse problem or machine learning including special cases such as Total Variation regularization, Edge Lasso and Fused Lasso. We study the geometry of the solution set (a polyhedron) of the analysis…
Incomplete pairwise comparison matrices offer a natural way of expressing preferences in decision making processes. Although ordinal information is crucial, there is a bias in the literature: cardinal models dominate. Ordinal models usually…
We Propose A Novel Automaton Model which uses Arithmetic Operations as the Evolving Rules, each cell has the states of the Natural Numbers k = (N), a radius of r = 1/2 and operates on an arbitrary input size. The Automaton reads an…
We extend an implicit regularization scheme to be applicable in the $n$-dimensional space-time. Within this scheme divergences involving parity violating objects can be consistently treated without recoursing to dimensional continuation.…
We show that any first order ordinary differential equation with a known Lie point symmetry group can be discretized into a difference scheme with the same symmetry group. In general, the lattices are not regular ones, but must be adapted…
For two-dimensional lattice equations one definition of integrability is that the model can be naturally and consistently extended to three dimensions, i.e., that it is "consistent around a cube" (CAC). As a consequence of CAC one can…
It is speculated that there is a relationship between 1/f noise and computational universality in cellular automata. We use genetic algorithms to search for one-dimensional and two-state, five-neighbor cellular automata which have 1/f-type…
While the surjectivity of the global map in two-dimensional cellular automata (2D CA) is undecidable in general, in specific cases one can often decide if the rule is surjective or not. We attempt to classify as many 2D CA as possible by…
We study the continuous model of the localized wave propagation corresponding to the one-dimensional diatomic crystal lattice. From the mathematical point of view the problem can be described in terms of the Cauchy problem with localized…