English
Related papers

Related papers: Finitely Balanced Sequences and Plasticity of 1-Di…

200 papers

To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…

Dynamical Systems · Mathematics 2018-07-18 Lorenzo Sadun

We investigate the dynamics of substitution subshifts and their associated tiling spaces. For a given subshift, the associated tiling spaces are all homeomorphic, but their dynamical properties may differ. We give criteria for such a tiling…

Dynamical Systems · Mathematics 2018-07-11 Alex Clark , Lorenzo Sadun

We study the diagonals of two-dimensional tilings generated by direct product substitutions. The properties of these diagonals are primarily determined by the eigenvalues of the substitution matrix, but also the order of the letters in the…

Dynamical Systems · Mathematics 2013-02-18 Michel Dekking

In the present paper, as we did previously in [7], we investigate the relations between the geometric properties of tilings and the algebraic properties of associated relational structures. Our study is motivated by the existence of…

Metric Geometry · Mathematics 2010-02-19 Francis Oger

Tilings and tiling systems are an abstract concept that arise both as a computational model and as a dynamical system. In this paper, we characterize the sets of periods that a tiling system can produce. We prove that up to a slight…

Discrete Mathematics · Computer Science 2009-09-23 Emmanuel Jeandel , Pascal Vanier

This paper presents a detailed symbolic approach to the study of self-similar tilings. It uses properties of addresses associated with graph-directed iterated function systems to establish conjugacy properties of tiling spaces. Tiles may be…

Dynamical Systems · Mathematics 2020-11-30 Michael F. Barnsley , Louisa F. Barnsley , Andrew Vince

We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.

Algebraic Geometry · Mathematics 2016-02-26 Rob Eggermont

A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…

Combinatorics · Mathematics 2007-05-23 Ethan M. Coven , William Geller , Sylvia Silberger , William P. Thurston

We consider tiling dynamical systems and topological conjugacies between them. We prove that the criterion of being finite type is invariant under topological conjugacy. For substitution tiling systems under rather general conditions,…

Dynamical Systems · Mathematics 2018-07-18 Charles Holton , Charles Radin , Lorenzo Sadun

We investigate the dynamics of tiling dynamical systems and their deformations. If two tiling systems have identical combinatorics, then the tiling spaces are homeomorphic, but their dynamical properties may differ. There is a natural map…

Dynamical Systems · Mathematics 2018-07-11 Alex Clark , Lorenzo Sadun

Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view,…

Discrete Mathematics · Computer Science 2009-02-11 Nathalie Aubrun , Mathieu Sablik

In this paper we have shown that a double sequence in a topological space satisfies certain conditions which in turn are capable to generate a topology on a non empty set. Also we have used the idea of I-convergence of double sequences to…

General Topology · Mathematics 2016-09-05 Amar Kumar Banerjee , Rahul Mondal

We consider log-convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log-balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions…

Combinatorics · Mathematics 2007-05-23 Tomislav Došlić

Bijective correspondences are established between (1) silting objects, (2) simple-minded collections, (3) bounded $t$-structures with length heart and (4) bounded co-$t$-structures. These correspondences are shown to commute with mutations.…

Representation Theory · Mathematics 2013-09-10 Steffen Koenig , Dong Yang

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

A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…

Combinatorics · Mathematics 2011-03-10 Thomas Fernique , Nicolas Ollinger

A basic assumption of tiling theory is that adjacent tiles can meet in only a finite number of ways, up to rigid motions. However, there are many interesting tiling spaces that do not have this property. They have "fault lines", along which…

Dynamical Systems · Mathematics 2007-05-23 Natalie Priebe Frank , Lorenzo Sadun

When identified with sequences of irreducible Hermitian-Einstein connections, sequences of stable holomorphic bundles of fixed topological type and bounded degree on a compact complex surface equipped with a Gauduchon metric are shown to…

alg-geom · Mathematics 2008-02-03 Nicholas P. Buchdahl

This paper studies balance properties for billiard words. Billiard words generalize Sturmian words by coding trajectories in hypercubic billiards. In the setting of aperiodic order, they also provide the simplest examples of quasicrystals,…

Dynamical Systems · Mathematics 2026-02-17 Nicolas Bédaride , Valérie Berthé , Antoine Julien

Given a tiling of a 2D grid with several types of tiles, we can count for every row and column how many tiles of each type it intersects. These numbers are called the_projections_. We are interested in the problem of reconstructing a tiling…

Computational Complexity · Computer Science 2009-09-25 Marek Chrobak , Peter Couperus , Christoph Durr , Gerhard Woeginger
‹ Prev 1 2 3 10 Next ›