Related papers: Low-Complexity Tilings of the Plane
Recently holographic prescriptions are proposed to compute quantum complexity of a given state in the boundary theory. A specific proposal known as `holographic subregion complexity' is supposed to calculate the the complexity of a reduced…
A grid method using tiling by fundamental domain of simple 2D lattices is presented. It refer to a previous work done by Stampfli in $1986$ using two tilings by regular hexagons, one rotate by $\pi/2$ relatively to the other. This allows to…
Let $X\subset A^{Z^d}$ be a $2$-dimensional subshift of finite type. We prove that any $2$-dimensional multidimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general…
In their solution to the orchard-planting problem, Green and Tao established a structure theorem which proves that in a line arrangement in the real projective plane with few double points, most lines are tangent to the dual curve of a…
By using two different invariants for the Rubik's Magic puzzle, one of metric type, the other of topological type, we can dramatically reduce the universe of constructible configurations of the puzzle. Finding the set of actually…
Contemporary large models often exhibit behaviors suggesting the presence of low-level primitives that compose into modules with richer functionality, but these fundamental building blocks remain poorly understood. We investigate this…
Let 1_k 0_l denote the (k+l)\times 1 column of k 1's above l 0's. Let q. (1_k 0_l) $ denote the (k+l)xq matrix with q copies of the column 1_k0_l. A 2-design S_{\lambda}(2,3,v) can be defined as a vx(\lambda/3)\binom{v}{2} (0,1)-matrix with…
Icosahedral tilings, although non-periodic, are known to be characterized by their configurations of some finite size. This characterization has also been expressed in terms of a simple alternation condition. We provide an alternative proof…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
We investigate the descriptional complexity of limited propagating Lindenmayer systems and their deterministic and tabled variants with respect to the number of rules and the number of symbols. We determine the decrease of complexity when…
A \emph{2-interval} is the union of two disjoint intervals on the real line. Two 2-intervals $D_1$ and $D_2$ are \emph{disjoint} if their intersection is empty (i.e., no interval of $D_1$ intersects any interval of $D_2$). There can be…
Robustness of linear systems with constant coefficients is considered. There exist methods and tools for analyzing the stability of systems with random or deterministic uncertainties. At the same time, there are no approaches for the…
Consider the network of elements connected by adjacency in atomic number and periodic table column. If all elements except H-He are connected by identical springs and constrained to a z-spiral in 2D, a map sans spring-crossing results for…
Configuring consists in simulating the realization of a complex product from a catalog of component parts, using known relations between types, and picking values for object attributes. This highly combinatorial problem in the field of…
A vertex coloring of a simplicial complex $\Delta$ is called a linear coloring if it satisfies the property that for every pair of facets $(F_1, F_2)$ of $\Delta$, there exists no pair of vertices $(v_1, v_2)$ with the same color such that…
The aim of this note is to describe a geometric relation between simple plane curve singularities classified by simply laced Cartan matrices and cluster varieties of finite type also classified by the simply laced Cartan matrices. We…
The study of tilings is a major problem in many mathematical instances, which is studied in two main different approaches: when considering the existence (or obstructions to the existence) of a tiling with a given tile and the other…
It is well-known that in two dimensions Turing systems produce spots, stripes and labyrinthine patterns, and in three dimensions lamellar and spherical structures or their combinations are observed. We study transitions between these states…
Symmetry is at the heart of much of mathematics, physics, and art. Traditional geometric symmetry groups are defined in terms of isometries of the ambient space of a shape or pattern. If we slightly generalize this notion to allow the…