English
Related papers

Related papers: Proper decompositions of finitely presented groups

200 papers

We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…

Group Theory · Mathematics 2022-01-19 Matthew J. Conder

We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…

Group Theory · Mathematics 2018-07-02 Nicholas W. M. Touikan

We introduce two new types of Dehn functions of group presentations which seem more suitable (than the standard Dehn function) for infinite group presentations and prove the fundamental equivalence between the solvability of the word…

Group Theory · Mathematics 2009-02-10 R. I. Grigorchuk , S. V. Ivanov

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

Combinatorics · Mathematics 2019-01-04 Agelos Georgakopoulos , Matthias Hamann

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

Dynamical Systems · Mathematics 2023-10-05 Zihan Xia

In this paper, we explain the importance of finite decomposition semigroups and present two theorems related to their structure.

Combinatorics · Mathematics 2013-03-19 Matthieu Deneufchâtel , Gérard H. E. Duchamp

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 construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…

Representation Theory · Mathematics 2025-04-15 Fabio Scarabotti

We show that there is no algorithm deciding whether the maximal residually free quotient of a given finitely presented group is finitely presentable or not. Given a finitely generated subgroup G of a finite product of limit groups, we…

Group Theory · Mathematics 2019-06-07 Vincent Guirardel , Gilbert Levitt

We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word problem, and computablity for the Dehn function. We prove that…

Group Theory · Mathematics 2013-01-16 Desmond Cummins

In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.

Algebraic Topology · Mathematics 2010-12-09 Behrooz Mashayekhy , Hanieh Mirebrahimi

In this paper we study the notion of configuration for group actions. It is proved that some properties concerning configuration of groups can be extended for the case of group actions. The relationship between configuration and different…

Group Theory · Mathematics 2021-12-07 A. Rejali , A. Yousofzadeh , M. Meisami , M. Soleimani

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

Group Theory · Mathematics 2015-07-07 Emmanuel Jeandel

Determining whether a given program terminates is the quintessential undecidable problem. Algorithms for termination analysis are divided into two groups: (1) algorithms with strong behavioral guarantees that work in limited circumstances…

Programming Languages · Computer Science 2021-09-16 Shaowei Zhu , Zachary Kincaid

This paper investigates the critical group of a faithful representation of a finite group. It computes the order of the critical group in terms of the character values, and gives some restrictions on its subgroup structure. It also computes…

Combinatorics · Mathematics 2016-10-14 Christian Gaetz

Under reasonable assumptions, a group action on a module extends to the minimal free resolutions of the module. Explicit descriptions of these actions can lead to a better understanding of free resolutions by providing, for example,…

Commutative Algebra · Mathematics 2021-11-05 Federico Galetto

We give a simple algorithm that enables us to determine whether a subgroup of finite index of the Hecke group is normal.

Number Theory · Mathematics 2015-01-06 Cheng Lien Lang , Mong Lung Lang

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

Group Theory · Mathematics 2007-05-23 David Garber , Shmuel Kaplan , Mina Teicher

We study algebraic and model-theoretic properties of existentially closed fields with an action of a fixed finite group. Such fields turn out to be pseudo-algebraically closed in a rather strong sense. We place this work in a more general…

Logic · Mathematics 2019-05-24 Daniel Max Hoffmann , Piotr Kowalski

A survey of finite group actions on symplectic 4-manifolds is given with a special emphasis on results and questions concerning smooth or symplectic classification of group actions, group actions and exotic smooth structures, and…

Geometric Topology · Mathematics 2010-09-16 Weimin Chen