English
Related papers

Related papers: Finitely generated lattice-ordered groups with sol…

200 papers

With each semigroup one can associate a partial algebra, called the biordered set, which captures important algebraic and geometric features of the structure of idempotents of that semigroup. For a biordered set $\mathcal{E}$, one can…

Group Theory · Mathematics 2022-10-07 Igor Dolinka

In this paper we describe finitely generated groups $H$ universally equivalent (with constants from $G$ in the language) to a given torsion-free relatively hyperbolic group $G$ with free abelian parabolics. It turns out that, as in the free…

Group Theory · Mathematics 2013-05-17 O. Kharlampovich , A. Myasnikov

Pursueing our investigations on the relations between Thompson groups and mapping class groups, we introduce the group $T^*$ (and its further generalizations) which is an extension of the Ptolemy-Thompson group $T$ by means of the full…

Geometric Topology · Mathematics 2014-11-11 Louis Funar , Christophe Kapoudjian

Two finite groups are said to have the same order type if for each positive integer $n$ both groups have the same number of elements of order $n$. In 1987 John G. Thompson asked if in this case the solvability of one group implies the…

Group Theory · Mathematics 2024-08-16 Peter Müller

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

Group Theory · Mathematics 2008-01-03 R. Guralnick , B. Kunyavskii , E. Plotkin , A. Shalev

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Group Theory · Mathematics 2025-03-04 Alexander Buturlakin , Anton Klyachko , Denis Osin

In this paper we study the generic, i.e., typical, behavior of finitely generated subgroups of hyperbolic groups and also the generic behavior of the word problem for amenable groups. We show that a random set of elements of a nonelementary…

Group Theory · Mathematics 2010-07-06 Robert Gilman , Alexei Miasnikov , Denis Osin

Every finite group $G$ has a normal series each of whose factors is either a solvable group or a direct product of non-abelian simple groups. The minimum number of nonsolvable factors, attained on all possible such series in $G$, is called…

Group Theory · Mathematics 2022-07-13 Francesco Fumagalli , Felix Leinen , Orazio Puglisi

The category of all idempotent generated semigroups with a prescribed structure $\mathcal{E}$ of their idempotents $E$ (called the biordered set) has an initial object called the free idempotent generated semigroup over $\mathcal{E}$,…

Group Theory · Mathematics 2017-12-14 Igor Dolinka , Robert D. Gray , Nik Ruškuc

It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with 'solubility' replaced by 'nilpotence' and 'perfectness', among…

Group Theory · Mathematics 2021-05-11 Yves Cornulier , John S. Wilson

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

Group Theory · Mathematics 2021-07-15 Derek Holt , Sarah Rees

It is shown that there exists a finitely generated infinite simple group of infinite commutator width, and that the commutator width of a finitely generated infinite boundedly simple group can be arbitrarily large. Besides, such groups can…

Group Theory · Mathematics 2009-09-14 Alexey Muranov

Let $G$ be a finite group, $N(G)$ be the set of conjugacy classes of the group $G$. In the present paper it is proved $G\simeq L$ if $N(G)=N(L)$, where $G$ is a finite group with trivial center and $L$ is a finite simple group.

Group Theory · Mathematics 2018-06-25 Ilya Gorshkov

Consider a relatively hyperbolic group G. We prove that if G is finitely presented, so are its parabolic subgroups. Moreover, a presentation of the parabolic subgroups can be found algorithmically from a presentation of G, a solution of its…

Group Theory · Mathematics 2014-10-01 François Dahmani , Vincent Guirardel

In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…

Group Theory · Mathematics 2023-10-18 V. H. Mikaelian

We exhibit classes of groups in which the word problem is uniformly solvable but in which there is no algorithm that can compute finite presentations for finitely presentable subgroups. Direct products of hyperbolic groups, groups of…

Group Theory · Mathematics 2011-03-01 Martin R Bridson , Henry Wilton

Motivated by a theorem of Groves and Wilton, we propose the study of the lattice of numberings of isomorphism classes of marked groups as a rigorous and comprehensive framework to study global decision problems for finitely generated…

Group Theory · Mathematics 2025-10-16 Emmanuel Rauzy

We study groups whose co-word problems are ET0L languages, which we call coET0L groups, using an automaton based model due to van Leeuwen, and recently studied by Bishop and Elder. In particular we prove a number of closure results for the…

Group Theory · Mathematics 2026-02-25 Raad Al Kohli , Derek F. Holt , Sarah Rees

A subgroup $H$ of a group $G$ is $commensurated$ in $G$ if for each $g\in G$, $gHg^{-1}\cap H$ has finite index in both $H$ and $gHg^{-1}$. If there is a sequence of subgroups $H=Q_0\prec Q_1\prec ...\prec Q_{k}\prec Q_{k+1}=G$ where $Q_i$…

Group Theory · Mathematics 2016-12-21 Michael Mihalik

It is known that in any free group the isolator of finitely generated subgroup is finitely generated subgroup. A very simple proof of this statement is proposed.

Group Theory · Mathematics 2020-09-22 David Moldavanskii
‹ Prev 1 4 5 6 7 8 10 Next ›