English
Related papers

Related papers: Pattern Complexity of Aperiodic Substitutive Subsh…

200 papers

We study tilings of the plane that combine strong properties of different nature: combinatorial and algorithmic. We prove existence of a tile set that accepts only quasiperiodic and non-recursive tilings. Our construction is based on the…

Discrete Mathematics · Computer Science 2015-06-15 Bruno Durand , Andrei Romashchenko

A fundamental challenge in multiparameter persistent homology is the absence of a complete and discrete invariant. To address this issue, we propose an enhanced framework that realizes a holistic understanding of a fully commutative…

Algebraic Topology · Mathematics 2023-11-14 Yasuaki Hiraoka , Ken Nakashima , Ippei Obayashi , Chenguang Xu

Spatial aperiodicity occurs in various models and material s. Although today the most well-known examples occur in the area of quasicrystals, other applications might also be of interest. Here we discuss some issues related to the notion…

Mathematical Physics · Physics 2023-07-19 Aernout C. D. van Enter

In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…

Formal Languages and Automata Theory · Computer Science 2015-08-20 Robert Mercaş

We prove that a subshift $(X,T)$ is linearly recurrent if and only if it is a primitive and proper $S$-adic subshift. This corrects Proposition 6 in F. Durand ({\it Ergod. Th. & Dynam. Sys. {\bf 20}} (2000), 1061--1078).

Dynamical Systems · Mathematics 2008-08-07 Fabien Durand

We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…

Geometric Topology · Mathematics 2021-04-16 Wei Lin

In the paper we study aperiodic substitutional dynamical systems arisen from non-primitive substitutions. We prove that the Vershik homeomorphism $\phi$ of a stationary ordered Bratteli diagram is homeomorphic to an aperiodic substitutional…

Dynamical Systems · Mathematics 2007-05-29 S. Bezuglyi , J. Kwiatkowski , K. Medynets

We study the long time behaviour of the transient before the collapse on the periodic attractors of a discrete deterministic asymmetric neural networks model. The system has a finite number of possible states so it is not possible to use…

Condensed Matter · Physics 2009-10-22 A. Crisanti , M falcioni , A. Vulpiani

The paper studies different variants of almost periodicity notion. We introduce the class of eventually strongly almost periodic sequences where some suffix is strongly almost periodic (=uniformly recurrent). The class of almost periodic…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

We consider the alternating sign matrices of the odd order that have some kind of central symmetry. Namely, we deal with matrices invariant under the half-turn, quarter-turn and flips in both diagonals. In all these cases, there are two…

Mathematical Physics · Physics 2008-07-17 Yu. G. Stroganov

This article studies the expected occupancy probabilities on an alphabet. Unlike the standard situation, where observations are assumed to be independent and identically distributed (iid), we assume that they follow a regime switching…

Probability · Mathematics 2020-05-19 Michael Grabchak , Mark Kelbert , Quentin Paris

We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…

Data Structures and Algorithms · Computer Science 2019-02-15 Zeev Dvir , Alexander Golovnev , Omri Weinstein

We consider dynamical systems arising from substitutions over a finite alphabet. We prove that such a system is linearly repetitive if and only if it is minimal. Based on this characterization we extend various results from primitive…

Dynamical Systems · Mathematics 2015-02-24 D. Damanik , D. Lenz

We connect the mixing behaviour of random walks over a graph to the power of the local-consistency algorithm for the solution of the corresponding constraint satisfaction problem (CSP). We extend this connection to arbitrary CSPs and their…

Computational Complexity · Computer Science 2024-11-01 Lorenzo Ciardo , Stanislav Živný

Moir\'e patterns are omnipresent. They are important for any overlapping periodic phenomenon, from vibrational and electromagnetic, to condensed matter. Here we show, both theoretically and via experimental simulations by ultracold atoms,…

We study the parameterized complexity of the problems of finding a maximum common (induced) subgraph of two given graphs. Since these problems generalize several NP-complete problems, they are intractable even when parameterized by strongly…

Data Structures and Algorithms · Computer Science 2025-12-09 Tesshu Hanaka , Yuto Okada , Yota Otachi , Lena Volk

The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…

Systems and Control · Electrical Eng. & Systems 2022-03-15 Matteo Della Rossa , Lucas N. Egidio , Raphaël M. Jungers

Rhythmic activities that alternate between coherent and incoherent phases are ubiquitous in chemical, ecological, climate, or neural systems. Despite their importance, general mechanisms for their emergence are little understood. In order…

Adaptation and Self-Organizing Systems · Physics 2022-06-01 Max Thiele , Rico Berner , Peter A. Tass , Eckehard Schöll , Serhiy Yanchuk

We investigate the stability of maximizing measures for a penalty function of a two-dimensional subshift of finite type, building on the work of Gonschorowski et al. \cite{GQS}. In the one-dimensional case, such measures remain stable under…

Dynamical Systems · Mathematics 2025-07-22 Chihiro Oguri , Mao Shinoda

Complexity of patterns is a key information for human brain to differ objects of about the same size and shape. Like other innate human senses, the complexity perception cannot be easily quantified. We propose a transparent and universal…

Pattern Formation and Solitons · Physics 2020-12-30 Andrey A. Bagrov , Ilia A. Iakovlev , Askar A. Iliasov , Mikhail I. Katsnelson , Vladimir V. Mazurenko
‹ Prev 1 8 9 10 Next ›