English
Related papers

Related papers: Twisted conjugacy in free groups and Makanin's que…

200 papers

For $N\geq 4$, we show that there exist automorphisms of the free group $F_N$ which have a parabolic orbit in $\partial F_N$. In fact, we exhibit a technology for producing infinitely many such examples.

Group Theory · Mathematics 2014-10-01 Arnaud Hilion

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…

Computational Complexity · Computer Science 2018-09-05 Pierre Guillon , Emmanuel Jeandel , Jarkko Kari , Pascal Vanier

It was previously shown by Grunewald and Lubotzky that the automorphism group of a free group, $\text{Aut}(F_n)$, has a large collection of virtual arithmetic quotients. Analogous results were proved for the mapping class group by Looijenga…

Geometric Topology · Mathematics 2020-05-06 Justin Malestein

Let $F_n$ be the free group of rank $n$ with free basis $X=\{x_1,\dots,x_n \}$. A palindrome is a word in $X^{\pm 1}$ that reads the same backwards as forwards. The palindromic automorphism group $\Pi A_n$ of $F_n$ consists of those…

Group Theory · Mathematics 2017-04-25 Valeriy G. Bardakov , Krishnendu Gongopadhyay , Mahender Singh

We give a simple algorithm to solve the subgroup membership problem for virtually free groups. For a fixed virtually free group with a fixed generating set $X$, the subgroup membership problem is uniformly solvable in time $O(n\log^*(n))$…

Group Theory · Mathematics 2025-06-18 Sam Cookson , Nicholas Touikan

This research was motivated by universal algebraic geometry. One of the central questions of universal algebraic geometry is: when two algebras have the same algebraic geometry? For answer of this question (see [Pl],[Ts]) we must consider…

Group Theory · Mathematics 2007-05-23 A. Tsurkov

Let $G$ be a finitely generated group with an automorphism $\varphi\in{\rm Aut}(G)$, or an outer automorphism $\phi\in{\rm Out}(G)$. Suppose that $G$ decomposes into simpler pieces on which the growth behaviour of $\varphi$ and $\phi$ is…

Group Theory · Mathematics 2026-03-13 Elia Fioravanti

We describe the automorphism group of the endomorphism semigroup $\End(K[x_1,...,x_n])$ of ring $K[x_1,...,x_n]$ of polynomials over an {\it arbitrary} field $K$. A similar result is obtained for automorphism group of the category of…

Rings and Algebras · Mathematics 2017-12-05 A. Belov-Kanel , R. Lipyanski

We analyze the structure of the \emph{frequency space} $Q(F)$ of a nonabelian free group $F=F(a_1,...,a_k)$ consisting of all shift-invariant Borel probability measures on $\partial F$ and construct a natural action of $Out(F)$ on $Q(F)$.…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich

A cylinder $C^1_u$ is the set of infinite words with fixed prefix $u$. A double-cylinder $C^2_{[1,u]}$ is "the same" for bi-infinite words. We show that for every word $u$ and any automorphism $\varphi$ of the free group $F$ the image…

Group Theory · Mathematics 2012-11-13 Fedaa Ibrahim

Let F_n be a free group of rank n>1. Two elements g, h in F_n are said to be translation equivalent in F_n if the cyclic length of \phi(g) equals the cyclic length of \phi(h) for every automorphism \phi of F_n. Let F(a, b) be the free group…

Group Theory · Mathematics 2011-05-03 Donghi Lee

Let $F_n= F\langle x_1,...,x_n\rangle$ denote the free group of rank $n\ge 2$ and let $\mathrm{End}(F_n)$ be the endomorphism monoid of $F_n$. We show that automorphisms of $F_n$ are detected via the $\mathrm{End}(F_n)$-action on the first…

Geometric Topology · Mathematics 2025-02-04 Emre Yüksel

A word in a free group is called ``potentially positive'' if it is automorphic to an element which is written with only positive exponents. We will develop automata to analyze properties of potentially positive words. We will use these to…

Group Theory · Mathematics 2025-12-17 Emma Dinowitz , Lucy Koch-Hyde , Siobhan O'Connor , Eamonn Olive

We give a reduction of the conjugacy problem among outer automorphisms of free (and torsion-free hyperbolic) groups to specific algorithmic problems pertaining to mapping tori of polynomially growing automorphisms. We explain how to use…

Group Theory · Mathematics 2025-10-03 François Dahmani , Nicholas Touikan

Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism F, we denote by k(X)^F its field of invariants, i.e. the set of rational functions f on X such that f(F)=f. Let n(F)…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Bonnet

We begin by establishing two fundamental results on standard parabolic subgroups of virtual Artin groups. We first show that a standard parabolic subgroup is naturally isomorphic to a virtual Artin group. Second, we prove that the…

Group Theory · Mathematics 2026-03-02 José Gálvez Mateos , Federica Gavazzi , Luis Paris

The main result of this paper is an algorithmic answer to the question raised in the title, up to replacing the given $\hat{\phi} \in Out(F_n)$ by a positive power. In order to provide this algorithm, it is shown that every polynomially…

Group Theory · Mathematics 2016-05-25 Kaidi Ye

Sets of solutions to finite systems of equations in a free group, are equivalent to sets of homomorphisms from a fixed f.p. group into a free group. The latter can be encoded in a diagram, the construction of which is valid also for f.g.…

Group Theory · Mathematics 2018-02-08 Gili Berk

We prove that for a free product $G$ with free factor system $\mathcal{G}$, any automorphism $\phi$ preserving $\mathcal{G}$, atoroidal (in a sense relative to $\mathcal{G}$) and none of whose power send two different conjugates of…

Group Theory · Mathematics 2020-08-28 François Dahmani , Ruoyu Li

We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…

Formal Languages and Automata Theory · Computer Science 2025-02-19 Daniele D'Angeli , Emanuele Rodaro , Jan Philipp Wächter