English
Related papers

Related papers: On an algorithm to decide whether a free group is …

200 papers

Let F_n denote the free group generated by n letters. The purpose of this article is to show that Hol(F_2), the holomorph of the free group on two generators, is linear. Consequently, any split group extension of F_2 by a linear group H is…

Group Theory · Mathematics 2009-05-05 F. R. Cohen , V. Metaftsis , S. Prassidis

Let $G$ be the generalized free product of two groups with an amalgamated subgroup. We propose an approach that allows one to use results on the residual $p$-finiteness of $G$ for proving that this generalized free product is residually a…

Group Theory · Mathematics 2024-05-24 E. V. Sokolov

Let $F$ be a finitely generated free group, and let $H\le F$ be a finitely generated subgroup. An equation for an element $g\in F$ with coefficients in $H$ is an element $w(x)\in H*\langle x \rangle$ such that $w(g)=1$ in $F$; the degree of…

Group Theory · Mathematics 2024-03-26 Dario Ascari

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 study the commensurators of free groups and free pro-$p$ groups, as well as certain subgroups of these. We prove that the commensurator $Comm(F)$ of a non-abelian free group of finite rank $F$ is not virtually simple, answering a…

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

We prove the levelwise finite generation of free polynomial $G$-Tambara functors in a collection of cases, most notably when $G$ is a finite Dedekind group or when $G \cong C_p \rtimes C_q$, $p > q$ primes. In the process, we establish the…

Group Theory · Mathematics 2025-11-04 Emory Sun

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 find homogeneous counting quasimorphisms that are effective at seeing chains in a free group F. As corollary, we derive that if a group G has an index-d free subgroup, then every element g in G either has stable commutator length at…

Group Theory · Mathematics 2016-05-13 Jing Tao

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

Rings and Algebras · Mathematics 2025-07-01 Pim Spelier

Let $F_m$ be the free group on $m$ generators and let $G$ be a finite nilpotent group of non square-free order; we show that for each $m\ge 2$ the integral group ring ${\bf Z}[G\times F_m]$ has infinitely many stably free modules of rank 1.

Rings and Algebras · Mathematics 2012-09-12 Seamus O'Shea

Functional graphs (FGs) model the graph structures used to analyse the behaviour of functions from a discrete set to itself. In turn, such functions are used to study real complex phenomena evolving in time. As the systems involved can be…

Dynamical Systems · Mathematics 2024-04-05 François Doré , Enrico Formenti , Antonio E. Porreca , Sara Riva

We give sufficient conditions for when groups generated by automata in a class $\mathcal{C}$ of transducers, which contains the class of reset automata transducers, have infinite order. As a consequence we also demonstrate that if a group…

Group Theory · Mathematics 2020-04-01 Feyishayo Olukoya

Every semigroup which is a finite disjoint union of copies of the free mono- genic semigroup (natural numbers under addition) has soluble word prob- lem and soluble membership problem. Efficient algorithms are given for both problems.

Group Theory · Mathematics 2016-12-08 Nabilah Abughazalah

A subset $X$ of a finite group $G$ is said to be prime-power-independent if each element in $X$ has prime power order and there is no proper subset $Y$ of $X$ with $\langle Y, \Phi(G)\rangle = \langle X, \Phi(G)\rangle$, where $\Phi(G)$ is…

Group Theory · Mathematics 2021-01-18 Andrea Lucchini , Pablo Spiga

We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the variables in a given symbolic matrix as to maximize the…

Data Structures and Algorithms · Computer Science 2014-07-11 Gábor Ivanyos , Marek Karpinski , Nitin Saxena

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

Group Theory · Mathematics 2016-05-03 Alexei Miasnikov , Paul E. Schupp

It is shown that for any finitely generated subgroups H and K of a free group F, and for any element g in F the double coset HgK is closed in the profinite topology of F.

Group Theory · Mathematics 2013-06-04 Rita Gitik , Eliyahu Rips

We introduce the notion of residual finiteness for categories. In analogy with the group-theoretic setting, we prove that free categories and finitely generated subcategories of finite-dimensional vector spaces are residually finite.…

Category Theory · Mathematics 2019-03-28 Clara Loeh

In analogy with the free factors of a free group we define special factors of Generalized Baumslag-Solitar (GBS) groups as non-cyclic subgroups which appear in splittings over infinite cyclic groups. We give an algorithm which, given a GBS…

Group Theory · Mathematics 2021-07-28 Chloé Papin
‹ Prev 1 8 9 10 Next ›