English
Related papers

Related papers: On sets of indefinitely desubstitutable words

200 papers

Let A be an alphabet and W be a set of words in the free monoid A*. Let S(W) denote the Rees quotient over the ideal of A* consisting of all words that are not subwords of words in W. We call a set of words W finitely based if the monoid…

Group Theory · Mathematics 2016-09-09 Olga Sapir

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen

We study equalizers and fixed points of monomorphisms of free groups at infinity. We show that the action of the equalizer of two monomorphisms on the regular points of the equalizer at infinity has finitely many orbits, showing that the…

Group Theory · Mathematics 2026-04-02 André Carvalho , Pedro V. Silva

It is proved that the fixed point submonoid and the periodic point submonoid of a trace monoid endomorphism are always finitely generated. Considering the Foata normal form metric on trace monoids and uniformly continuous endomorphisms, a…

Group Theory · Mathematics 2012-11-20 Pedro V. Silva , Emanuele Rodaro

A subset of a group is characteristic if it is invariant under every automorphism of the group. We study word length in fundamental groups of closed hyperbolic surfaces with respect to characteristic generating sets consisting of a finite…

Group Theory · Mathematics 2008-04-07 Danny Calegari

It has been shown by Lubotzky in [10] that the set of verbal images of a fixed non-abelian finite simple group G is precisely the set of endomorphism invariant subsets of G. Here we use his result to determine the verbal images of certain…

Group Theory · Mathematics 2013-02-04 Matthew Levy

We describe the notion of stability of coherent systems as a framework to deal with redundancy. We define stable coherent systems and show how this notion can help the design of reliable systems. We demonstrate that the reliability of…

We obtain conditions of uniform continuity for endomorphisms of free-abelian times free groups for the product metric defined by taking the prefix metric in each component and establish an equivalence between uniform continuity for this…

Group Theory · Mathematics 2021-10-07 André Carvalho

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina

We define and study Noetherian topologies for spaces of infinite sets, and infinite words. In each case, we also obtain S-representations, namely, computable presentations of the sobrifications of those spaces.

General Topology · Mathematics 2021-03-23 Jean Goubault-Larrecq

Prefix normal words are binary words that have no factor with more $1$s than the prefix of the same length. Finite prefix normal words were introduced in [Fici and Lipt\'ak, DLT 2011]. In this paper, we study infinite prefix normal words…

Combinatorics · Mathematics 2021-05-31 Ferdinando Cicalese , Zsuzsanna Lipták , Massimiliano Rossi

Given an infinite word ${\bf w}$ on a finite alphabet, an immediate question arises:~can we understand the frequency of letters in ${\bf w}$\,? For words that are the fixed points of substitutions, the answer to this question is often `yes'…

Combinatorics · Mathematics 2024-10-17 Michael Coons , Christopher Ramsey , Nicolae Strungaru

It is shown, for a given graph group $G$, that the fixed point subgroup Fix$\,\varphi$ is finitely generated for every endomorphism $\varphi$ of $G$ if and only if $G$ is a free product of free abelian groups. The same conditions hold for…

Group Theory · Mathematics 2013-10-29 Emanuele Rodaro , Pedro V. Silva , Mihalis Sykiotis

A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Joey Becker , F. Blanchet-Sadri , Laure Flapan , Stephen Watkins

We prove a theorem on structural stability of smooth attractor-repellor endomorphisms of compact manifolds, with singularities. By attractor-repellor, we mean that the non-wandering set of the dynamics $f$ is the disjoint union of a…

Dynamical Systems · Mathematics 2008-09-02 Pierre Berger

We study fixed point sets for holomorphic automorphisms (and endomorphisms) on complex manifolds. The main object of our interest is to determine the number and configuration of fixed points that forces an automorphism (endomorphism) to be…

Complex Variables · Mathematics 2007-05-23 Buma L. Fridman , Daowei Ma , Jean-Pierre Vigue

Any amicable pair \phi, \psi{} of Sturmian morphisms enables a construction of a ternary morphism \eta{} which preserves the set of infinite words coding 3-interval exchange. We determine the number of amicable pairs with the same incidence…

Combinatorics · Mathematics 2012-03-29 Tomáš Hejda

The category of quasi frames (or qframes) is introduced and studied. In the context of qframes we can jointly study problems related to the L-Surjunctivity and Stable Finiteness Conjectures. As a consequences of our main results, we can…

Rings and Algebras · Mathematics 2018-01-17 Simone Virili

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

We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…

Group Theory · Mathematics 2026-04-01 Tom Hutchcroft , Nicolas Monod , Omer Tamuz