English
Related papers

Related papers: A note on test elements for monomorphisms of free …

200 papers

We describe a group theoretic condition which ensures that any cellular action of a group satisfying this condition on a CAT(0) cube complex has a global fixed point. In particular, we show that this fixed point criterion is satisfied by…

Group Theory · Mathematics 2018-05-14 Olga Varghese

The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…

Group Theory · Mathematics 2019-02-15 Sayyed Heidar Jafari

An element $g$ of a group $G$ is a test element if every endomorphism of $G$ that fixes $g$ is an automorphism. Let $G$ be a free group of finite rank, an orientable surface group of genus $n \geq 2$, or a non-orientable surface group of…

Group Theory · Mathematics 2015-09-09 Ilir Snopce , Slobodan Tanushevski

In this paper, we study the fibers of "automorphic word maps", a certain generalization of word maps, on finite groups and on nonabelian finite simple groups in particular. As an application, we derive a structural restriction on finite…

Group Theory · Mathematics 2016-10-14 Alexander Bors

Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…

Group Theory · Mathematics 2009-10-06 Enric Ventura

A polynomial algorithm for graphs' isomorphism testing is constructed in assumption that there exists a corresponding polynomial algorithm for graphs with trivial automorphism group.

Combinatorics · Mathematics 2007-05-23 Aleksandr Golubchik

The attempt is to give a formal concpet of system, and with this provide a definition of category, that will also satisfy the definition of a system. An axiomatic base is given, for constructing the group of integers. In the process, we…

Category Theory · Mathematics 2015-11-26 Juan Pablo Ramirez

Let $F$ be a free group of finite rank. We say that the monomorphism problem in $F$ is decidable if for any two elements $u$ and $v$ in $F$, there is an algorithm that determines whether there exists a monomorphism of $F$ that sends $u$ to…

Group Theory · Mathematics 2009-10-13 Laura Ciobanu , Abderezak Ould Houcine

Autostackability for finitely presented groups is a topological property of the Cayley graph combined with formal language theoretic restrictions, that implies solvability of the word problem. The class of autostackable groups is known to…

Group Theory · Mathematics 2015-06-02 Mark Brittenham , Susan Hermiller , Ashley Johnson

A Cayley object for a group G is a structure on which G acts regularly as a group of automorphisms. The main theorem asserts that a necessary and sufficient condition for the free abelian group G of rank m to have the generic n-tuple of…

Combinatorics · Mathematics 2012-09-17 Peter J. Cameron

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

A subgroup $H$ of a free group $F$ is called inert in $F$ if for every $G < F$ the rank of the intersection of $H$ with $G$ is no grater than the rank of $G$. In this paper we expand the known families of inert subgroups. We show that the…

Group Theory · Mathematics 2014-12-23 Amnon Rosenmann

We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed subgroups of free group automorphisms, and one…

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

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

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

Group Theory · Mathematics 2013-07-19 Mark Brittenham , Susan Hermiller , Derek Holt

An automorphism of a group is said to be normal if it preserves each normal subgroup. In this paper, we determine the normal automorphisms of a free metabelian nilpotent group.

Group Theory · Mathematics 2007-11-19 G. Endimioni

Let $G$ be a group. The directed endomorphism graph, $\dend(G)$ of $G$ is a directed graph with vertex set $G$ and there is a directed edge from the vertex $a$ to the vertex $b$ if $a \neq b$ and there exists an endomorphism on $G$ mapping…

Group Theory · Mathematics 2025-11-20 Midhuna V Ajith , Peter J Cameron , Mainak Ghosh , Aparna Lakshmanan S

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…

Group Theory · Mathematics 2014-11-11 Henry Wilton

In a paper from 2011, Jiang, Wang and Zhang studied the fixed points and fixed subgroups of selfmaps on a connected finite graph or a connected compact hyperbolic surface $X$. In particular, for any selfmap $f: X\to X$, they proved that a…

Geometric Topology · Mathematics 2025-07-10 Peng Wang , Qiang Zhang

Let $K$ be a field of positive characteristic and $K<x, y>$ be the free algebra of rank two over $K$. Based on the degree estimate done by Y.-C. Li and J.-T. Yu, we extend the results of S.J. Gong and J.T. Yu's results: (1) An element…

Rings and Algebras · Mathematics 2010-12-01 Yun-Chang Li , Jie-Tai Yu