English
Related papers

Related papers: On certain C-test words for free groups

200 papers

We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…

Combinatorics · Mathematics 2023-10-24 Mohamed Slim Kammoun , Mylène Maïda

Let $m,n$ be positive integers and $w$ a multilinear commutator word. Assume that $G$ is a finite group having subgroups $G_1,\ldots,G_m$ whose union contains all $w$-values in $G$. Assume further that all elements of the subgroups…

Group Theory · Mathematics 2019-01-08 Pavel Shumyatsky , Danilo Silveira

A group-word w is called concise if whenever the set of w-values in a group G is finite it always follows that the verbal subgroup w(G) is finite. More generally, a word w is said to be concise in a class of groups X if whenever the set of…

Group Theory · Mathematics 2014-06-30 Robert Guralnick , Pavel Shumyatsky

Let $G$ be a group. An element $g \in G$ is called a test element of $G$ if for every endomorphism $\varphi:G \to G$, $\varphi(g)=g$ implies that $\varphi$ is an automorphism. We prove that for a finitely generated profinite group $G$, $g…

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

A finitely generated group G is termed parafree if it is residually nilpotent and it has the same isomorphism types of nilpotent quotients as some free group. The two main results of this MSc. Thesis characterise the parafreeness of two…

Group Theory · Mathematics 2021-09-29 Ismael Morales

Cyclic words are equivalence classes of cyclic permutations of ordinary words. When a group is given by a rewriting relation, a rewriting system on cyclic words is induced, which is used to construct algorithms to find minimal length…

Group Theory · Mathematics 2012-11-14 Volker Diekert , Andrew Duncan , Alexei Myasnikov

Let F_{n+m} be the free group of rank n+m, with generators x_1,...,x_{n+m}. An automorphism \phi of F_{n+m} is called partially symmetric if for each 1 \le i \le m, \phi(x_i) is conjugate to x_j or x_j^{-1} for some 1 \le j \le m. Let…

Group Theory · Mathematics 2014-10-01 Matthew C. B. Zaremsky

A generalized word in two letters $A$ and $B$ is an expression of the form $W=A^{\alpha_1}B^{\beta_1}A^{\alpha_2}B^{\beta_2}... A^{\alpha_N}B^{\beta_N}$ in which the exponents $\alpha_i$, $\beta_i$ are nonzero real numbers. When independent…

Operator Algebras · Mathematics 2007-05-23 Christopher Hillar , Charles R. Johnson , Ilya M. Spitkovsky

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

For a given ideal I in K[x_1,...,x_n,y_1,...,y_m] in a polynomial ring with n+m variables, we want to find all elements that can be written as f-g for some f in K[x_1,...,x_n] and some g in K[y_1,...,y_m], i.e., all elements of I that…

Symbolic Computation · Computer Science 2024-05-30 Manfred Buchacher , Manuel Kauers

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy…

Group Theory · Mathematics 2023-10-16 André Carvalho

We begin with a new analysis of formal words. Let w be a formal word in letters g_1,...,g_k. The word map associated with w maps the permutations s_1,...,s_k in S_n to the permutation obtained by replacing for each i, every occurrence of…

Combinatorics · Mathematics 2011-04-21 Nati Linial , Doron Puder

Let $G$ be the fundamental group of a graph of finitely generated virtually free groups with virtually cyclic edge groups. We shaw that $G$ is cohomologically good if $G$ is residually finite. If $G$ is LERF, we prove that G splits…

Group Theory · Mathematics 2026-03-18 Andrei Jaikin-Zapirain , Henrique Souza , Pavel Zalesski

For the free group $F_r$ on $r>1$ generators (respectively, the free product $G_1 * G_2$ of two nontrivial finite groups $G_1$ and $G_2$), we obtain the asymptotic for the number of conjugacy classes of commutators in $F_r$ (respectively,…

Group Theory · Mathematics 2019-02-12 Peter S. Park

Let $H$ be a torsion-free $\delta$-hyperbolic group with respect to a finite generating set $S$. Let $a_1,..., a_n$ and $a_{1*},..., a_{n*}$ be elements of $H$ such that $a_{i*}$ is conjugate to $a_i$ for each $i=1,..., n$. Then, there is a…

Group Theory · Mathematics 2010-02-24 O. Bogopolski , E. Ventura

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

A ring $R$ is said to be $n$-clean if every element can be written as a sum of an idempotent and $n$ units. The class of these rings contains clean ring and $n$-good rings in which each element is a sum of $n$ units. In this paper, we show…

Rings and Algebras · Mathematics 2007-05-23 Zhou Wang , Jianlong Chen

Let F_2 be the free group generated by x and y. In this article, we prove that the commutator of x^m and y^n is a product of two squares if and only if mn is even. We also show using topological methods that there are infinitely many…

Group Theory · Mathematics 2014-10-01 Sucharit Sarkar

Let F_n = <x_1,...,x_n> denote the free group with generators {x_1,...,x_n}. Nielsen and Magnus described generators for the kernel of the canonical epimorphism from the automorphism group of F_n to the general linear group over the…

Group Theory · Mathematics 2012-02-21 F R Cohen , J Pakianathan , V V Vershinin , Jie Wu

Let $G$ be a group. Write $G^{*}=G\setminus \{1\}$. An element $x$ of $G^{*}$ will be called deficient if $ \langle x\rangle < C_G(x)$ and it will be called non-deficient if $\langle x\rangle = C_G(x).$ If $x\in G$ is deficient…

Group Theory · Mathematics 2023-03-21 Marcel Herzog , Patrizia Longobardi , Mercede Maj
‹ Prev 1 4 5 6 7 8 10 Next ›