中文
相关论文

相关论文: Quasiperiodic Sturmian words and morphisms

200 篇论文

We present a brief history of quasicrystals and a short introduction to classical lattice-gas models of interacting particles. We discuss stability of non-periodic tilings and one-dimensional sequences of symbols seen as ground states of…

数学物理 · 物理学 2024-12-30 Jacek Miȩkisz

The concept of square-mean almost automorphy for stochastic processes is introduced. The existence and uniqueness of square-mean almost automorphic solutions to some linear and non-linear stochastic differential equations are established…

动力系统 · 数学 2010-01-19 Miaomiao Fu , Zhenxin Liu

The paper deals with quasigroups having a trivial group of automorphisms and a trivial group of autotopisms. Examples of such quasigroups and methods of their verification are given.

群论 · 数学 2009-05-26 Andriy I. Deriyenko , Ivan I. Deriyenko , Wieslaw A. Dudek

We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms…

组合数学 · 数学 2008-11-14 Petr Ambrož , Zuzana Masáková , Edita Pelantová

We show that the Suslov nonholonomic rigid body problem can be regarded almost everywhere as a generalized Chaplygin system. Furthermore, this provides a new example of a multidimensional nonholonomic system which can be reduced to a…

数学物理 · 物理学 2007-05-23 Yuri N. Fedorov , Bozidar Jovanovic

We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…

组合数学 · 数学 2021-03-18 Sebastián Barbieri , Sébastien Labbé , Štěpán Starosta

Two finite words $u$ and $v$ are called abelian equivalent if each letter occurs equally many times in both $u$ and $v$. The abelian closure $\mathcal{A}(\mathbf{x})$ of an infinite word $\mathbf{x}$ is the set of infinite words…

组合数学 · 数学 2021-01-01 Juhani Karhumäki , Svetlana Puzynina , Markus A. Whiteland

We define families of aperiodic words associated to Lorenz knots that arise naturally as syllable permutations of symbolic words corresponding to torus knots. An algorithm to construct symbolic words of satellite Lorenz knots is defined. We…

几何拓扑 · 数学 2014-09-25 Paulo Gomes , Nuno Franco , Luis Silva

We prove that a self-homeomorphism of the Grushin plane is quasisymmetric if and only if it is metrically quasiconformal and if and only if it is geometrically quasiconformal. As the main step in our argument, we show that a quasisymmetric…

度量几何 · 数学 2021-12-20 Chris Gartland , Derek Jung , Matthew Romney

We explore the relationship between subgroups and the possible shifts of finite type (SFTs) that can be defined on the group. In particular, we investigate two group invariants, weak periodicity and strong periodicity, defined via symbolic…

群论 · 数学 2015-09-15 David Carroll , Andrew Penland

Trapezoidal words are words having at most $n+1$ distinct factors of length $n$ for every $n\ge 0$. They therefore encompass finite Sturmian words. We give combinatorial characterizations of trapezoidal words and exhibit a formula for their…

形式语言与自动机理论 · 计算机科学 2013-01-22 Michelangelo Bucci , Alessandro De Luca , Gabriele Fici

We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…

动力系统 · 数学 2023-07-21 Sebastián Barbieri

Between space crystals and amorphous materials there exists a third class of aperiodic structures which lack translational symmetry but reveal long-range order. They are dubbed quasi-crystals and their formation, similarly as the formation…

量子气体 · 物理学 2019-06-19 Krzysztof Giergiel , Arkadiusz Kuroś , Krzysztof Sacha

We show that the permutation complexity of the image of a Sturmian word by a binary marked morphism is $n+k$ for some constant $k$ and all lengths $n$ sufficiently large.

组合数学 · 数学 2023-06-22 Adam Borchert , Narad Rampersad

Given an infinite word X over an alphabet A a letter b occurring in X, and a total order \sigma on A, we call the smallest word with respect to \sigma starting with b in the shift orbit closure of X an extremal word of X. In this paper we…

组合数学 · 数学 2013-07-22 James D. Currie , Narad Rampersad , Kalle Saari , Luca Q. Zamboni

We study infinite words fixed by a morphism and their derived words. A derived word is a coding of return words to a factor. We exhibit two examples of sets of morphisms which are closed under derivation --- any derived word with respect to…

组合数学 · 数学 2019-11-28 Václav Košík , Štěpán Starosta

We introduce an equivalence relation, called cobordism, for words and study cobordism invariants of words inspired by methods of low-dimensional topology.

组合数学 · 数学 2008-06-09 Vladimir Turaev

We introduce the notion of $\alpha$-numbers and formal intercept of sturmian words, and derive from this study general factorisations formula for sturmian words. Sturmian words are defined as infinite words with lowest unbound complexity,…

组合数学 · 数学 2025-04-21 Caius Wojcik

We present a geometric formulation of existence of time quasi-periodic solutions. As an application, we prove the existence of quasi-periodic solutions of $b$ frequencies, $b\leq d+2$, in arbitrary dimension $d$ and for arbitrary non…

偏微分方程分析 · 数学 2009-07-28 Wei-Min Wang

This paper is concerned with palindromes occurring in characteristic Sturmian words $c_\alpha$ of slope $\alpha$, where $\alpha \in (0,1)$ is an irrational. As $c_\alpha$ is a uniformly recurrent infinite word, any (palindromic) factor of…

组合数学 · 数学 2010-03-16 Amy Glen