English
Related papers

Related papers: A finitely presented orderable group with insolubl…

200 papers

Let $G$ be a group that is relatively hyperbolic with respect to a collection of subgroups $\{H_{\lambda}\}_{\lambda\in \Lambda}$. Suppose that $G$ is given by a finite relative presentation $\mathcal{P}$ with respect to this collection. We…

Group Theory · Mathematics 2025-01-09 Oleg Bogopolski

We show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

Group Theory · Mathematics 2017-08-16 Arman Darbinyan

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

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…

Group Theory · Mathematics 2014-07-18 William M. Kantor , Alexander Lubotzky , Aner Shalev

In this paper, the Identity Problem for certain groups, which asks if the subsemigroup generated by a given finite set of elements contains the identity element, is related to problems regarding ordered groups. Notably, the Identity Problem…

Group Theory · Mathematics 2025-11-26 Corentin Bodart , Laura Ciobanu , George Metcalfe

In this paper, we study the product of orders of composition factors of odd order in a composition series of a finite linear group. First we generalize a result by Manz and Wolf about the order of solvable linear groups of odd order. Then…

Group Theory · Mathematics 2020-06-09 Alexander Betz , Max Chao-Haft , Ting Gong , Anthony Ter-Saakov , Yong Yang

We present a new algorithm deciding if the intersection of a quasiconvex subgroup of a negatively curved group with a conjugate is finite. We also give a short proof of decidability of the membership problem for quasiconvex subgroups of…

Group Theory · Mathematics 2018-11-08 Rita Gitik

We prove that the word problem of the Brin-Thompson group nV over a finite generating set is coNP-complete for every n \ge 2. It is known that the groups nV are an infinite family of infinite, finitely presented, simple groups. We also…

Group Theory · Mathematics 2020-02-12 J. C. Birget

We exhibit a family of infinite, finitely-presented, nilpotent-by-abelian groups. Each member of this family is a solvable S-arithmetic group that is related to Baumslag-Solitar groups, and everyone of these groups has a quasi-isometry…

Group Theory · Mathematics 2007-05-23 Kevin Wortman

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

Group Theory · Mathematics 2017-04-21 Adam Clay , Kathryn Mann , Cristóbal Rivas

In this work we introduce a new succinct variant of the word problem in a finitely generated group $G$, which we call the power word problem: the input word may contain powers $p^x$, where $p$ is a finite word over generators of $G$ and $x$…

Group Theory · Mathematics 2019-04-18 Markus Lohrey , Armin Weiß

It is shown that finite groups in which the order of the product of every pair of elements of co-prime order is the product of the orders, is nilpotent.

Group Theory · Mathematics 2014-11-12 Benjamin Baumslag , James Wiegold

We determine the finite groups whose real irreducible representations have different degrees.

Group Theory · Mathematics 2025-05-08 Thomas Breuer , Frank Calegari , Silvio Dolfi , Gabriel Navarro , Pham Huu Tiep

We consider the two-variable fragment of first-order logic with one distinguished binary predicate constrained to be interpreted as a transitive relation. The finite satisfiability problem for this logic is shown to be decidable, in triply…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann

This is a report on our long term project to find an algorithm to decide if a finitely presented group has a non-trivial action on a tree.

Geometric Topology · Mathematics 2022-03-07 A. N. Bartholomew , M. J. Dunwoody

We study the complexity of computation in finitely generated free left, right and two-sided adequate semigroups and monoids. We present polynomial time (quadratic in the RAM model of computation) algorithms to solve the word problem and…

Rings and Algebras · Mathematics 2013-12-02 Mark Kambites , Alexandr Kazda

We exhibit infinitely many natural numbers $n$ for which there exists at least one insolvable group of order $n$, and yet the holomorph of any solvable group of order $n$ has no insolvable regular subgroup. We also solve Problem 19.90 (d)…

Group Theory · Mathematics 2020-03-20 Cindy Tsang , Chao Qin

Full set of autonomous completely solvable differential systems of equations in total differentials is built by basis of infinitesimal operators, universal invariant, and structure constants of admited multiparametric Lie group (abelian and…

Dynamical Systems · Mathematics 2013-01-16 V. N. Gorbuzov

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

Group Theory · Mathematics 2012-04-20 René Hartung

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

Rings and Algebras · Mathematics 2007-12-04 Mark Kambites
‹ Prev 1 3 4 5 6 7 10 Next ›