Algorithmically complex residually finite groups
From MaRDI portal
Abstract: We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function. The groups are solvable of class 3. We also prove that the universal theory of finite solvable of class 3 groups is undecidable.
Recommendations
- Publication:5749462
- Residually finite algorithmically finite groups, their subgroups and direct products.
- Algorithms for polycyclic-by-finite groups
- The algorithmic theory of polycyclic-by-finite groups
- scientific article; zbMATH DE number 1419254
- Algorithmic theory of solvable groups
- Groups with orderings of arbitrary algorithmic complexity
- scientific article; zbMATH DE number 4042057
- On certain residually finite groups
Cites work
- scientific article; zbMATH DE number 3138253 (Why is no real title available?)
- scientific article; zbMATH DE number 3815955 (Why is no real title available?)
- scientific article; zbMATH DE number 3762288 (Why is no real title available?)
- scientific article; zbMATH DE number 194088 (Why is no real title available?)
- scientific article; zbMATH DE number 459345 (Why is no real title available?)
- scientific article; zbMATH DE number 475447 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 1385418 (Why is no real title available?)
- scientific article; zbMATH DE number 3448564 (Why is no real title available?)
- scientific article; zbMATH DE number 848033 (Why is no real title available?)
- scientific article; zbMATH DE number 3285229 (Why is no real title available?)
- scientific article; zbMATH DE number 3333324 (Why is no real title available?)
- A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
- A RESIDUALLY FINITE VERSION OF RIPS'S CONSTRUCTION
- A family of groups with nice word problems
- A non-cyclic one-relator group all of whose finite quotients are cyclic
- ALGORITHMIC PROBLEMS IN VARIETIES
- ALMOST EVERY GROUP IS HYPERBOLIC
- Algorithmic problems in varieties of semigroups
- Asymptotic invariants, complexity of groups and related problems.
- Bounding the residual finiteness of free groups.
- Cubulating graphs of free groups with cyclic edge groups.
- Cubulating random groups at density less than \(1/6\).
- Finite index subgroups in profinite groups.
- Generation of polycyclic groups
- Golod-Shafarevich groups: a survey.
- Hydra group doubles are not residually finite.
- Hydra groups.
- Hyperbolic hydra.
- Infinite string rewrite systems and complexity
- Isoperimetric and isodiametric functions of groups
- Isoperimetric function of the Baumslag-Gersten group.
- Isoperimetric inequalities and the homology of groups
- LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
- Minsky Machines and Algorithmic Problems
- On finitely generated soluble linear groups
- On the parallel complexity of linear groups
- Polynomial Maps over p -Adics and Residual Properties of Mapping Tori of Group Endomorphisms
- Polynomial maps over finite fields and residual finiteness of mapping tori of group endomorphisms
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
- Quantifying residual finiteness.
- SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
- SOME DUALITY CONJECTURES FOR FINITE GRAPHS AND THEIR GROUP THEORETIC CONSEQUENCES
- Solution of the restricted Burnside problem for 2-groups
- Subgroups of Direct Products of Free Groups
- Subgroups of finitely presented groups
- Subgroups of finitely presented metabelian groups
- Subgroups of small Cancellation Groups
- THE WORD PROBLEM FOR SOLVABLE LIE ALGEBRAS AND GROUPS
- The Extrinsic Geometry of Subgroups and the Generalized Word Problem
- The decision problem for some classes of sentences without quantifiers
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
- Unsolvability of the universal theory of finite groups
- Varieties of groups
- Word Problems Solvable in Logspace
Cited in
(21)- Minsky Machines and Algorithmic Problems
- scientific article; zbMATH DE number 3877408 (Why is no real title available?)
- Residually finite algorithmically finite groups, their subgroups and direct products.
- Quantifying local embeddings into finite groups
- Isomorphism of finitely generated solvable groups is weakly universal.
- Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
- The set of quantum correlations is not closed
- The large-scale geometry of locally compact solvable groups
- Effective twisted conjugacy separability of nilpotent groups
- Taming the hydra: the word problem and extreme integer compression
- Amenable groups without finitely presented amenable covers
- Dehn functions of finitely presented metabelian groups
- Computability of finite quotients of finitely generated groups
- Zariski closures and subgroup separability
- Full residual finiteness growths of nilpotent groups
- Følner functions and the generic word problem for finitely generated amenable groups
- Hydra group doubles are not residually finite.
- Computability of Følner sets
- Intersection growth in groups
- Residual finiteness and strict distortion of cyclic subgroups of solvable groups
- Quantifying separability in limit groups via representations
This page was built for publication: Algorithmically complex residually finite groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1682244)
