English
Related papers

Related papers: Automorphic orbits in free groups: words versus su…

200 papers

For every finite rank k, k>1, we explicitly construct (2k)! left orders on the free group F_k of rank k. Each order is induced by a word of length 2k in which each generator of F_k and its inverse appear exactly once. For each of these…

Group Theory · Mathematics 2013-09-25 Zoran Sunic

An integral of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. In this paper, we prove that the integrability of a finite group is a decidable problem.

Group Theory · Mathematics 2026-02-24 Sathasivam Kalithasan , Viji Z. Thomas

Elder, Kambites, and Ostheimer showed that if the word problem of a finitely generated group $H$ is accepted by a $G$-automaton for an abelian group $G$, then $H$ is virtually abelian. We give a new, elementary, and purely combinatorial…

Group Theory · Mathematics 2022-11-01 Takao Yuyama

Let F be an infinitely generated free group and R a fully invariant subgroup of F such that (a) R is contained in the commutator subgroup F' of F and (b) the quotient group F/R is residually torsion-free nilpotent. Then the automorphism…

Group Theory · Mathematics 2010-03-26 Vladimir Tolstykh

The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank free group. We give the first fully polynomial algorithm to…

Group Theory · Mathematics 2008-01-06 Abdó Roig , Enric Ventura , Pascal Weil

Let F_2 be a free group of rank 2. We prove that there is an algorithm that decides whether or not, for given two elements u, v of F_2, u and v are translation equivalent in F_2, that is, whether or not u and v have the property that the…

Group Theory · Mathematics 2011-05-03 Donghi Lee

It is shown that the big free group (the set of countably-long words over a countable alphabet) is almost free, in the sense that any function from the alphabet to a compact topological group factors through a homomorphism. This statement…

Group Theory · Mathematics 2015-06-12 Tamer Tlas

Let u be a cyclic word in a free group F_n of finite rank n that has the minimum length over all cyclic words in its automorphic orbit, and let N(u) be the cardinality of the set {v: |v|=|u| and v= \phi(u) for some \phi \in \text {Aut}F_n}.…

Group Theory · Mathematics 2011-05-03 Donghi Lee

Let $\Bbbk$ be a perfect field with algebraic closure $\overline{\Bbbk}$. If $H$ is a subgroup of plane automorphisms over $\Bbbk$ and $p\in\overline{\Bbbk}^2$ is a point, we describe the subgroup consisting of plane automorphisms which…

Algebraic Geometry · Mathematics 2022-11-08 Iván Pan , Alvaro Rittatore

Let $\phi$ be an automorphism of a free group $F_n$ of rank $n$, and let $M_{\phi}=F_n \rtimes_{\phi} \mathbb{Z}$ be the corresponding mapping torus of $\phi$. We study the group $Out(M_{\phi})$ under certain technical conditions on $\phi$.…

Group Theory · Mathematics 2007-05-23 O. Bogopolski , A. Martino , E. Ventura

We consider decidability problems in self-similar semigroups, and in particular in semigroups of automatic transformations of $X^*$. We describe algorithms answering the word problem, and bound its complexity under some additional…

Group Theory · Mathematics 2017-05-19 Laurent Bartholdi

A concrete family of automorphisms alpha_n of the free group F_n is exhibited, for any n > 2, and the following properties are proved: alpha_n is irreducible with irreducible powers, has trivial fixed subgroup, and has 2n-1 attractive as…

Group Theory · Mathematics 2009-04-10 Andre Jaeger , Martin Lustig

We develop the theory of fragile words by introducing the concept of eraser morphism and extending the concept to more general contexts such as (free) inverse monoids. We characterize the image of the eraser morphism in the free group case,…

Group Theory · Mathematics 2019-10-08 Daniele D'Angeli , Emanuele Rodaro , Pedro V. Silva , Alexander Zakharov

Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…

Combinatorics · Mathematics 2021-03-24 William M. Kantor

We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…

Dynamical Systems · Mathematics 2023-09-13 Robbert Fokkink , Dan Rust , Ville Salo

We show that every automorphism $\alpha$ of a free group $F_k$ of finite rank $k$ has {\it asymptotically periodic} dynamics on $F_k$ and its boundary $\partial F_k$: there exists a positive power $\alpha^q$ such that every element of the…

Group Theory · Mathematics 2008-10-06 Gilbert Levitt , Martin Lustig

We study finite subgroups of outer automorphisms of free products. We give upper bounds for the orders of these finite subgroups as well as bounds for the orders of individual torsion outer automorphisms under some (necessary) conditions…

Group Theory · Mathematics 2025-06-23 Ioannis Papavasileiou , Dionysios Syrigos

Suppose that a finite group $G$ admits a Frobenius group of automorphisms FH of coprime order with cyclic kernel F and complement H such that the fixed point subgroup $C_G(H)$ of the complement is nilpotent of class $c$. It is proved that…

Group Theory · Mathematics 2013-05-30 E. I. Khukhro , N. Yu. Makarenko

Let $A_2$ be a free associative or polynomial algebra of rank two over a field $K$ of characteristic zero. Based on the degree estimate of Makar-Limanov and J.-T.Yu, we prove: 1) An element $p \in A_2$ is a test element if $p$ does not…

Rings and Algebras · Mathematics 2008-07-09 Sheng-Jun Gong , Jie-Tai Yu

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Logic · Mathematics 2023-07-25 Annalisa Conversano
‹ Prev 1 3 4 5 6 7 10 Next ›