English
Related papers

Related papers: Equations in groups that are virtually direct prod…

200 papers

We show that the Diophantine problem(decidability of equations) is undecidable in free associative algebras over any field and in the group algebras over any field of a wide variety of torsion free groups, including toral relatively…

Logic · Mathematics 2016-06-28 Olga Kharlampovich , Alexei Myasnikov

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

Group Theory · Mathematics 2017-11-28 Laurent Bartholdi , Ivan Mitrofanov

We prove that if every hyperbolic group is residually finite, then every quasi-convex subgroup of every hyperbolic group is separable. The main tool is relatively hyperbolic Dehn filling.

Group Theory · Mathematics 2014-11-11 Ian Agol , Daniel Groves , Jason Fox Manning

Dehn fillings for relatively hyperbolic groups generalize the topological Dehn surgery on a non-compact hyperbolic $3$-manifold such as a hyperbolic knot complement. We prove a rigidity result saying that if two non-elementary relatively…

Group Theory · Mathematics 2018-11-14 François Dahmani , Vincent Guirardel

A group with a geometric action on some hyperbolic space is necessarily word hyperbolic, but on the other hand every countable group acts (metrically) properly by isometries on a locally finite hyperbolic graph. In this paper we consider…

Group Theory · Mathematics 2021-11-29 J. O. Button

We give a new criterion for solvability of group equations, providing proofs of various generalizations of the Kervaire-Laudenbach conjecture for Connes-embeddable groups.

Group Theory · Mathematics 2021-09-27 Martin Nitsche , Andreas Thom

We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…

Group Theory · Mathematics 2015-11-04 Derek F. Holt , Sarah Rees

The integration of the Einstein equations split into the solution of constraints on an initial space like 3 - manifold, an essentially elliptic system, and a system which will describe the dynamical evolution, modulo a choice of gauge. We…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Yvonne Choquet-Bruhat

A relatively hyperbolic group $G$ is said to be QCERF if all finitely generated relatively quasiconvex subgroups are closed in the profinite topology on $G$. Assume that $G$ is a QCERF relatively hyperbolic group with double coset separable…

Group Theory · Mathematics 2025-04-02 Ashot Minasyan , Lawk Mineh

The knapsack problem for groups was introduced by Miasnikov, Nikolaev, and Ushakov. It is defined for each finitely generated group $G$ and takes as input group elements $g_1,\ldots,g_n,g\in G$ and asks whether there are $x_1,\ldots,x_n\ge…

Group Theory · Mathematics 2021-01-18 Pascal Bergsträßer , Moses Ganardi , Georg Zetzsche

Recently knapsack problems have been generalized from the integers to arbitrary finitely generated groups. The knapsack problem for a finitely generated group $G$ is the following decision problem: given a tuple $(g, g_1, \ldots, g_k)$ of…

Group Theory · Mathematics 2019-04-10 Markus Lohrey

We have solved completely the problem of the description of quasi-linear hyperbolic differential equations in two independent variables that are invariant under three-parameter Lie groups.

Mathematical Physics · Physics 2007-05-23 Olena Magda

Given a short exact sequence of groups with certain conditions, $1\to F\to G\to H\to 1$, we prove that $G$ has solvable conjugacy problem if and only if the corresponding action subgroup $A\leqslant Aut(F)$ is orbit decidable. From this, we…

Group Theory · Mathematics 2007-12-20 O. Bogopolski , A. Martino , E. Ventura

Ian Leary inquires whether a class of hyperbolic finitely presented groups are residually finite. We answer in the affirmative by giving a systematic version of a construction in his paper, which shows that the standard 2-complexes of these…

Group Theory · Mathematics 2013-10-04 Jason K. C. Polák , Daniel T. Wise

We give a complete complexity classification for the problem of finding a solution to a given system of equations over a fixed finite monoid, given that a solution over a more restricted monoid exists. As a corollary, we obtain a complexity…

Computational Complexity · Computer Science 2025-03-04 Alberto Larrauri , Stanislav Živný

We introduce the notion of idempotent variables for studying equations in inverse monoids. It is proved that it is decidable in singly exponential time (DEXPTIME) whether a system of equations in idempotent variables over a free inverse…

Logic in Computer Science · Computer Science 2015-09-28 Volker Diekert , Florent Martin , Geraud Senizergues , Pedro V. Silva

Hard instances of natural computational problems are often elusive. In this note we present an example of a natural decision problem, the word problem for a certain finitely presented group, whose hard instances are easy to find. More…

Computational Complexity · Computer Science 2016-02-09 Robert H Gilman

Two groups have a common model geometry if they act properly and cocompactly by isometries on the same proper geodesic metric space. The Milnor-Schwarz lemma implies that groups with a common model geometry are quasi-isometric; however, the…

Geometric Topology · Mathematics 2021-05-17 Emily Stark , Daniel J. Woodhouse

For a fixed word hyperbolic group we compare different residual properties related to quasiconvex subgroups.

Group Theory · Mathematics 2007-05-23 Ashot Minasyan

We consider groups defined by cyclic presentations where the defining word has length three and the cyclic presentation satisfies the T(6) small cancellation condition. We classify when these groups are hyperbolic. When combined with known…

Group Theory · Mathematics 2021-10-22 Ihechukwu Chinyere , Gerald Williams
‹ Prev 1 8 9 10 Next ›