Related papers: Fixed points of morphisms among binary generalized…
We exhibit invariants of smooth projective algebraic varieties with integer values, whose nonvanishing modulo p prevents the existence of an action without fixed points of certain finite p-groups. The case of base fields of characteristic p…
Generalized pseudostandard words were introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated…
We prove that if $F$ is a finitely generated abelian group of orientation preserving $C^1$ diffeomorphisms of $R^2$ which leaves invariant a compact set then there is a common fixed point for all elements of $F.$ We also show that if $F$ is…
Generalized pseudostandard word $\bf u$, as introduced in 2006 by de Luca and De Luca, is given by a directive sequence of letters from an alphabet ${\cal A}$ and by a directive sequence of involutory antimorphisms acting on ${\cal A}^*$.…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
This paper focuses on generalized pseudostandard words, defined by de Luca and De Luca in 2006. In every step of the construction, the involutory antimorphism to be applied for the pseudopalindromic closure changes and is given by a so…
We propose a new axiomatisation of the alpha-equivalence relation for nominal terms, based on a primitive notion of fixed-point constraint. We show that the standard freshness relation between atoms and terms can be derived from the more…
We prove that if $\F$ is an abelian group of $C^1$ diffeomorphisms isotopic to the identity of a closed surface $S$ of genus at least two then there is a common fixed point for all elements of $\F.$
A prefix normal word is a binary word whose prefixes contain at least as many 1s as any of its factors of the same length. Introduced by Fici and Lipt\'ak in 2011 the notion of prefix normality is so far only defined for words over the…
Generalized pseudostandard words were introduced by de Luca and De Luca in 2006. In comparison to the palindromic and pseudopalindromic closure, only little is known about the generalized pseudopalindromic closure and the associated…
We classify all finite subgroups of the plane Cremona group which have a fixed point. In other words, we determine all rational surfaces X with an action of a finite group G such that X is equivariantly birational to a surface which has a…
This article provides a reminder of some properties of primitive words and the morphisms that preserve them. Their proofs, which I have more or less revised, are included. This makes the article almost self-contained. I also contribute by…
We say that an infinite word w is weak abelian periodic if it can be factorized into finite words with the same frequencies of letters. In the paper we study properties of weak abelian periodicity, its relations with balance and frequency.…
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of…
We prove the existence of common fixed points for commuting homeomorphisms of the plane R^2 or the sphere S^2, which preserve a probability measure. For example: some commuting C^1-diffeomorphisms of S^2, which are sufficiently close to the…
We analyze the algorithm in [Holub, 2009], which decides whether a given word is a fixed point of a nontrivial morphism. We show that it can be implemented to have complexity in O(mn), where n is the length of the word and m the size of the…
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A…
In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…
We introduce and study natural derivatives for Christoffel and finite standard words, as well as for characteristic Sturmian words. These derivatives, which are realized as inverse images under suitable morphisms, preserve the…
We show that generic automorphisms of stable groups are supertight in a strong sense. In particular, we obtain the existence of supertight automorphisms. We also answer a question concerning the relationship between supertight automorphisms…