English
Related papers

Related papers: On sets of indefinitely desubstitutable words

200 papers

We obtain a simple family of solutions to the set-theoretic Yang-Baxter equation, one which depends only on considering special endomorphisms of a finite group. We show how such an endomorphism gives rise to two non-degenerate solutions to…

Group Theory · Mathematics 2020-06-24 Alan Koch , Laura Stordy , Paul J. Truman

A finite set S of words over the alphabet A is called non-complete if Fact(S*) is different from A*. A word w in A* - Fact(S*) is said to be uncompletable. We present a series of non-complete sets S_k whose minimal uncompletable words have…

Formal Languages and Automata Theory · Computer Science 2011-04-05 Vladimir V. Gusev , Elena V. Pribavkina

We investigate the size of fixed point sets of automorphisms of bounded domains in $\mathbb{C}^n$. In one complex variable, a nontrivial automorphism has at most two fixed points, but in higher dimensions fixed point sets need not be…

Complex Variables · Mathematics 2026-04-10 Bharathi Thiruvengadam , Jaikrishnan Janardhanan

We prove several decidability and undecidability results for the satisfiability and validity problems for languages that can express solutions to word equations with length constraints. The atomic formulas over this language are equality…

Logic in Computer Science · Computer Science 2013-06-26 Vijay Ganesh , Mia Minnes , Armando Solar-Lezama , Martin Rinard

An example of a time-invariant time-delay system that is uniformly globally attractive and exponentially stable, hence forward complete, but whose reachability sets from bounded initial conditions are not bounded over compact time intervals…

Systems and Control · Electrical Eng. & Systems 2024-02-13 Jose L. Mancilla-Aguilar , Hernan Haimovich

It is known that each word of length $n$ contains at most $n+1$ distinct palindromes. A finite rich word is a word with maximal number of palindromic factors. The definition of palindromic richness can be naturally extended to infinite…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Francesco Dolce , Edita Pelantová

It is well-known that there exist infinite sequences that are the fixed point of non-uniform morphisms, but not $k$-automatic for any $k$. In this note we show that every $k$-automatic sequence is the image of a fixed point of a {\it…

Number Theory · Mathematics 2021-03-23 Jean-Paul Allouche , Jeffrey Shallit

A word is square-free if it does not contain a nonempty word of the form $XX$ as a factor. A famous 1906 result of Thue asserts that there exist arbitrarily long square-free words over a $3$-letter alphabet. We study square-free words with…

Combinatorics · Mathematics 2022-09-20 Michał Dębski , Jarosław Grytczuk , Bartłomiej Pawlik

We study the existence of solutions arising from the modelling of elastic materials using generalized theories of continua. In view of some evidence from physics of meta-materials we focus our effort on two recent nonstandard relaxed…

Analysis of PDEs · Mathematics 2019-02-12 Sebastian Owczarek , Ionel-Dumitrel Ghiba , Marco-Valerio d'Agostino , Patrizio Neff

We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from…

Logic · Mathematics 2014-02-10 Itaï Ben Yaacov

We define the empiric stochastic stability of an invariant measure in the finite-time scenario, the classical definition of stochastic stability. We prove that an invariant measure of a continuous system is empirically stochastically stable…

Dynamical Systems · Mathematics 2018-03-01 Eleonora Catsigeras

We continue the study of the rich family of norm-closed, automorphism invariant ideals of a continuous nest algebra. First we present a unified framework which captures all stable ideals as the kernels of limits of diagonal compressions. We…

Operator Algebras · Mathematics 2014-01-08 John Lindsay Orr

The main purpose of this paper is to find the fixed point in such cases where existing literature remain silent. In this paper we introduce partial completeness, a new type of contraction and many other definitions. Using this approach the…

Functional Analysis · Mathematics 2018-03-23 Tawseef Rashid , Qamrul Haque Khan

This paper concerns piecewise-smooth maps on $\mathbb{R}^d$ that are continuous but not differentiable on switching manifolds (where the functional form of the map changes). The stability of fixed points on switching manifolds is…

Dynamical Systems · Mathematics 2016-12-12 David J. W. Simpson

We study the languages recognized by well-structured transition systems (WSTS) with upward and downward compatibility. Our first result shows that every pair of disjoint WSTS languages is regularly separable: there is a regular language…

Formal Languages and Automata Theory · Computer Science 2024-06-03 Wojciech Czerwiński , Eren Keskin , Sławomir Lasota , Roland Meyer , Sebastian Muskalla , K Narayan Kumar , Prakash Saivasan

A well-known result from Brouwer states that any orientation preserving homeomorphism of the plane with no fixed points has an empty non-wandering set. In particular, an invariant compact set implies the existence of a fixed point. In this…

Dynamical Systems · Mathematics 2019-06-11 Alejo García

We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…

Dynamical Systems · Mathematics 2025-12-19 Sebastián Barbieri , Leo Poirier

We study stability of amalgamated free products and HNN extensions of stable groups over finite groups. We focus on operator norm stability, Hilbert-Schmidt stability and stability in permutations. We provide many new examples of stable (or…

Group Theory · Mathematics 2023-07-14 Maria Gerasimova , Konstantin Shchepin

This paper describes an alternative method of generating fixed points of certain substitution systems. This method centres on taking infinite words consisting of one repeated letter per word. These infinite words are then interlaced to form…

Dynamical Systems · Mathematics 2012-03-01 David Fletcher

We address the problem of giving necessary and sufficient conditions in order to have robustly transitive endomorphisms admitting persistent critical sets. We exhibit different type of open examples of robustly transitive maps in any…

Dynamical Systems · Mathematics 2015-03-20 Jorge Iglesias , Cristina Lizana , Aldo Portela