English
Related papers

Related papers: Finding non-trivial elements and splittings in gro…

200 papers

In this paper we study a group G which is the quotient of a free product of three non-trivial groups by the normal closure of a single element. In particular we show that if the relator has length at most eight, then G is non-trivial. In…

Group Theory · Mathematics 2025-07-16 Ihechukwu Chinyere , James Howie

Let G be a finite group. A collection P={H1, ..., Hr} of subgroups of G, where r > 1, is said a non-trivial partition of G if every non-identity element of G belongs to one and only one Hi, for some 1 <=i<=r. We call a group G that does not…

Group Theory · Mathematics 2020-10-21 Afsane Bahri , Zeinab Akhlaghi , Behrooz Khosravi

A permutoid is a set of partial permutations that contains the identity and is such that partial compositions, when defined, have at most one extension in the set. In 2004 Peter Cameron conjectured that there can exist no algorithm that…

Group Theory · Mathematics 2017-02-09 Martin R. Bridson , Henry Wilton

We prove that the Picard group of a regular simply connected variety over an algebraically closed field of arbitrary characteristic is finitely generated. The main difficulty to overcome is the unavailability of resolution of singularities.…

Algebraic Geometry · Mathematics 2011-04-13 Lars Kindler

In this paper, we first construct a nonconforming finite element pair for the incompressible Stokes problem on quadrilateral grids, and then construct a discrete Stokes complex associated with that finite element pair. The finite element…

Numerical Analysis · Mathematics 2013-10-18 Shuo Zhang

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

Group Theory · Mathematics 2007-05-23 S. V. Ivanov

We investigate the complexity of deciding, given a multiplication table representing a semigroup S, a subset X of S and an element t of S, whether t can be expressed as a product of elements of X. It is well-known that this problem is…

Computational Complexity · Computer Science 2018-04-17 Lukas Fleischer

We consider necessary and sufficient conditions for finite generation and finite presentability for fiber products of free semigroups and free monoids. We give a necessary and sufficient condition on finite fiber quotients for a fiber…

Group Theory · Mathematics 2019-07-03 Ashley Clayton

A countable group is residually finite if every nontrivial element can act nontrivially on a finite set. When a group fails to be residually finite, we might want to measure how drastically it fails - it could be that only finitely many…

Group Theory · Mathematics 2024-01-11 Nic Brody , Kasia Jankiewicz

The statement ``no nonabelian simple group can be obtained from a nonsimple group by adding one generator and one relator" 1) is equivalent to the Kervaire--Laudenbach conjecture; 2) becomes true under the additional assumption that the…

Group Theory · Mathematics 2016-09-07 Anton A. Klyachko

In a number of recent works, it has been established that many virtually free groups, almost all fundamental groups of surfaces and all groups which are nontrivial free products of groups satisfying a non-trivial law are algebraically…

Group Theory · Mathematics 2020-01-29 Andrey Mazhuga

We prove that a finitely generated group contains a sequence of non-trivial elements which converge to the identity in every compact homomorphic image if and only if the group is not virtually abelian.

Group Theory · Mathematics 2019-08-15 Andreas Thom

By strengthening known results about primitivity-blocking words in free groups, we prove that for any nontrivial element w of a free group of finite rank, there are words that cannot be subwords of any cyclically reduced automorphic image…

Group Theory · Mathematics 2025-08-11 Lucy Koch-Hyde , Siobhan O'Connor , Eamonn Olive , Vladimir Shpilrain

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

Representation Theory · Mathematics 2018-10-10 Soham Swadhin Pradhan

We give an example of a finitely presented simple group containing a finitely generated subgroup which is not finitely presented.

Group Theory · Mathematics 2007-05-23 Diego Rattaggi

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

Group Theory · Mathematics 2026-01-22 V. H. Mikaelian

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 a previous paper, we defined a higher dimensional analog of Thompson's group V, and proved that it is simple, infinite, finitely generated, and not isomorphic to any of the known Thompson groups. There are other Thompson groups that are…

Group Theory · Mathematics 2013-09-04 Matthew G. Brin

In the first part of this note, we introduce Tietze transformations for $L$-presentations. These transformations enable us to generalize Tietze's theorem for finitely presented groups to invariantly finitely $L$-presented groups. Moreover,…

Group Theory · Mathematics 2012-05-02 René Hartung

In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…

Group Theory · Mathematics 2020-09-22 Vitaly Roman'kov