English
Related papers

Related papers: On sets of indefinitely desubstitutable words

200 papers

In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic…

Combinatorics · Mathematics 2010-03-16 Amy Glen , Jacques Justin

Indices of fixed point classes play a central role in Nielsen fixed point theory. Jiang-Wang-Zhang proved that for selfmaps of graphs and surfaces, the index of any fixed point class has an upper bound called its characteristic. In this…

Geometric Topology · Mathematics 2020-05-26 Qiang Zhang , Xuezhi Zhao

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Computational Complexity · Computer Science 2013-09-24 Armin Hemmerling

Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…

Computational Geometry · Computer Science 2024-05-10 Philip Smith , Vitaliy Kurlin

We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…

Combinatorics · Mathematics 2022-04-12 Vitaly Bergelson , Jake Huryn , Rushil Raghavan

The concept of a uniform set is introduced for an ergodic, measure-preserving transformation on a non-atomic, infinite Lebesgue space. The uniform sets exist as much as they generate the underlying $\sigma$-algebra. This leads to the result…

Dynamical Systems · Mathematics 2011-08-22 Hisatoshi Yuasa

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi

This article began as a study of the structure of infinite permutation groups G in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point…

Group Theory · Mathematics 2015-12-16 Peter M. Neumann , Cheryl E. Praeger , Simon M. Smith

We show stable ergodicity of a class of conservative diffeomorphisms which do not have any hyperbolic invariant subbundle. Moreover the uniqueness of SRB measures for non-conservative $C^1$ perturbations of such diffeomorphisms. This class…

Dynamical Systems · Mathematics 2007-05-23 Ali Tahzibi

For a surjective self-morphism on a projective variety defined over a number field, we study the preimages question, which asks if the set of rational points on the iterated preimages of an invariant closed subscheme eventually stabilize.…

Algebraic Geometry · Mathematics 2023-11-07 Yohsuke Matsuzawa , Kaoru Sano

Let $w$ be a word in a free group. A few years ago, Magee and the first named author discovered that the stable commutator length (scl) of $w$, a well-known topological invariant, can also be defined in terms of certain Fourier coefficients…

Group Theory · Mathematics 2026-05-08 Doron Puder , Yotam Shomroni , Danielle Ernst-West , Matan Seidel

We consider input-deterministic finite state transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality on infinite words. When these transducers are given by a strongly connected set of states,…

Formal Languages and Automata Theory · Computer Science 2019-04-22 Olivier Carton , Elisa Orduna

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…

Logic in Computer Science · Computer Science 2023-06-22 Jérémy Dubut , Akihisa Yamada

In this paper we introduce and study a new property of infinite words: An infinite word $x\in A^\mathbb{N}$, with values in a finite set $A$, is said to be $k$-self-shuffling $(k\geq 2)$ if $x$ admits factorizations: $x=\prod_{i=0}^\infty…

Combinatorics · Mathematics 2014-11-17 Émilie Charlier , Teturo Kamae , Svetlana Puzynina , Luca Q. Zamboni

Substitution systems evolve in time by generating sequences of symbols from a finite alphabet: At a certain iteration step, the existing symbols are systematically replaced by blocks of $N_{k}$ symbols also within the alphabet (with…

Mathematical Physics · Physics 2015-07-08 Vladimir Garcia-Morales

This paper addresses the stability analysis of infinite-dimensional sampled-data systems under unbounded perturbations. We present two classes of unbounded perturbations preserving the exponential stability of sampled-data systems. To this…

Optimization and Control · Mathematics 2019-10-04 Masashi Wakaiki , Yutaka Yamamoto

We introduced the notation of a set of prohibitions and give definitions of a complete set and a crucial word with respect to a given set of prohibitions. We consider 3 particular sets which appear in different areas of mathematics and for…

Combinatorics · Mathematics 2007-05-23 A. Evdokimov , S. Kitaev

Constant structure closed semantic systems are the systems each element of which receives its definition through the correspondent unchangeable set of other elements of the system. Discrete time means here that the definitions of the…

Artificial Intelligence · Computer Science 2017-11-21 Evgeny Ivanko

We classify spectrum-preserving endomorphisms of stable continuous-trace C^*-algebras up to inner automorphism by a surjective multiplicative invariant taking values in finite dimensional vector bundles over the spectrum. Specializing to…

Operator Algebras · Mathematics 2007-05-23 Ilan Hirshberg

Generalizing the notion of the boundary sequence introduced by Chen and Wen, the $n$th term of the $\ell$-boundary sequence of an infinite word is the finite set of pairs $(u,v)$ of prefixes and suffixes of length $\ell$ appearing in…

Combinatorics · Mathematics 2022-12-09 Michel Rigo , Manon Stipulanti , Markus A. Whiteland
‹ Prev 1 3 4 5 6 7 10 Next ›