English
Related papers

Related papers: On Configurations of Order 2

200 papers

We consider $d$-dimensional configurations, that is, colorings of the $d$-dimensional integer grid $\mathbb{Z}^d$ with finitely many colors. Moreover, we interpret the colors as integers so that configurations are functions $\mathbb{Z}^d…

Discrete Mathematics · Computer Science 2026-05-28 Pyry Herva , Jarkko Kari

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…

Classical Analysis and ODEs · Mathematics 2021-09-27 Rachel Greenfeld , Terence Tao

We study tilings of the plane composed of two repeating tiles of different assigned areas relative to an arbitrary periodic lattice. We classify isoperimetric configurations (i.e., configurations with minimal length of the interfaces) both…

Metric Geometry · Mathematics 2025-08-26 Francesco Nobili , Matteo Novaga , Emanuele Paolini

A two-dimensional configuration is a coloring of the infinite grid Z^2 with finitely many colors. For a finite subset D of Z^2, the D-patterns of a configuration are the colored patterns of shape D that appear in the configuration. The…

Discrete Mathematics · Computer Science 2019-05-13 Jarkko Kari

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…

Combinatorics · Mathematics 2016-08-16 Nicolas Bédaride , Thomas Fernique

We study complexity and periodicity of Delone sets by applying an algebraic approach to multidimensional symbolic dynamics. In this algebraic approach, $\mathbb{Z}^d$-configurations $c: \mathbb{Z}^d \to \mathcal{A}$ for a finite set…

Dynamical Systems · Mathematics 2025-04-30 Pyry Herva , Jarkko Kari

A d-dimensional configuration c : Z^d -> A is a coloring of the d-dimensional infinite grid by elements of a finite alphabet A \subseteq Z. The configuration c has an annihilator if a non-trivial linear combination of finitely many…

Discrete Mathematics · Computer Science 2023-01-18 Jarkko Kari

In the first part, after showing that the most natural approach to define an order on sets of conformal classes fails, we define a nontrivial order $\leq_2$ on the set of conformal classes of compact Cauchy slabs with fixed past boundary…

Differential Geometry · Mathematics 2025-10-22 Olaf Müller

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2016-05-20 Jarkko Kari , Michal Szabados

We study here slopes of periodicity of tilings. A tiling is of slope if it is periodic along direction but has no other direction of periodicity. We characterize in this paper the set of slopes we can achieve with tilings, and prove they…

Discrete Mathematics · Computer Science 2010-12-08 Emmanuel Jeandel , Pascal Vanier

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian…

Information Theory · Computer Science 2021-05-13 Maiara F. Bollauf , Øyvind Ytrehus

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…

Other Computer Science · Computer Science 2008-02-21 Alexis Ballier , Bruno Durand , Emmanuel Jeandel

In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…

Combinatorics · Mathematics 2023-09-18 Hassan Douzi

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

Nivat's conjecture is a long-standing open combinatorial problem. It concerns two-dimensional configurations, that is, maps $\mathbb Z^2 \rightarrow \mathcal A$ where $\mathcal A$ is a finite set of symbols. Such configurations are often…

Discrete Mathematics · Computer Science 2017-10-17 Michal Szabados

Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…

Statistical Mechanics · Physics 2024-12-24 Eduardo J. Aguilar , Valmir C. Barbosa , Raul Donangelo , Sergio R. Souza

The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…

Information Theory · Computer Science 2023-09-25 Zhiru Chen , Zhixiong Chen , Jakob Obrovsky , Arne Winterhof

It has been shown by McCoy that a right ideal of a polynomial ring with several indeterminates has a non-trivial homogeneous right annihilator of degree 0 provided its right annihilator is non-trivial to begin with. In this note, it is…

Rings and Algebras · Mathematics 2018-01-10 Thomas Huettemann

Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and…

Combinatorics · Mathematics 2012-10-26 Emanuele Delucchi , Simona Settepanella

The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z^d}$ which tiles that lattice by translations, in fact tiles periodically. We announce here a disproof of this conjecture for sufficiently large $d$, which…

Combinatorics · Mathematics 2022-09-20 Rachel Greenfeld , Terence Tao
‹ Prev 1 2 3 10 Next ›