Algorithmically complex residually finite groups

DOI10.1007/s13373-017-0103-zzbMath1423.20022arXiv1204.6506OpenAlexW2964336870WikidataQ59611694 ScholiaQ59611694MaRDI QIDQ1682244

O. G. Kharlampovich, Alexei G. Myasnikov, Mark V. Sapir

Publication date: 29 November 2017

Published in: Bulletin of Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.6506

zbMATH Keywords

word problemdepth functionMinsky machineDehn function

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Residual properties and generalizations; residually finite groups (20E26)

Related Items (18)

Zariski closures and subgroup separability ⋮ Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem ⋮ Full residual finiteness growths of nilpotent groups ⋮ Taming the hydra: The word problem and extreme integer compression ⋮ Hydra group doubles are not residually finite. ⋮ Quantifying local embeddings into finite groups ⋮ Følner functions and the generic word problem for finitely generated amenable groups ⋮ Minsky Machines and Algorithmic Problems ⋮ Computability of Følner sets ⋮ Intersection growth in groups ⋮ THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED ⋮ Dehn functions of finitely presented metabelian groups ⋮ Isomorphism of finitely generated solvable groups is weakly universal. ⋮ Amenable groups without finitely presented amenable covers ⋮ Residual finiteness and strict distortion of cyclic subgroups of solvable groups ⋮ The large-scale geometry of locally compact solvable groups ⋮ Effective twisted conjugacy separability of nilpotent groups ⋮ Computability of finite quotients of finitely generated groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hydra group doubles are not residually finite.
• Hydra groups.
• 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
• Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
• On finitely generated soluble linear groups
• Infinite string rewrite systems and complexity
• Isoperimetric inequalities and the homology of groups
• Finite index subgroups in profinite groups.
• Polynomial maps over finite fields and residual finiteness of mapping tori of group endomorphisms
• Algorithmic problems in varieties of semigroups
• Isoperimetric and isodiametric functions of groups
• Quantifying residual finiteness.
• Hyperbolic hydra.
• GOLOD–SHAFAREVICH GROUPS: A SURVEY
• Minsky Machines and Algorithmic Problems
• Cubulating graphs of free groups with cyclic edge groups
• Cubulating random groups at density less than $1/6$
• Asymptotic invariants, complexity of groups and related problems
• Subgroups of finitely presented groups
• Generation of polycyclic groups
• Polynomial Maps over p -Adics and Residual Properties of Mapping Tori of Group Endomorphisms
• THE WORD PROBLEM FOR SOLVABLE LIE ALGEBRAS AND GROUPS
• SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
• Subgroups of small Cancellation Groups
• On the parallel complexity of linear groups
• ALMOST EVERY GROUP IS HYPERBOLIC
• A family of groups with nice word problems
• Word Problems Solvable in Logspace
• The Extrinsic Geometry of Subgroups and the Generalized Word Problem
• A RESIDUALLY FINITE VERSION OF RIPS'S CONSTRUCTION
• Subgroups of finitely presented metabelian groups
• LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
• ALGORITHMIC PROBLEMS IN VARIETIES
• Subgroups of Direct Products of Free Groups
• Bounding the residual finiteness of free groups
• SOME DUALITY CONJECTURES FOR FINITE GRAPHS AND THEIR GROUP THEORETIC CONSEQUENCES
• Varieties of groups
• A non-cyclic one-relator group all of whose finite quotients are cyclic
• A Finitely Generated Residually Finite Group with an Unsolvable Word Problem
• The decision problem for some classes of sentences without quantifiers

This page was built for publication: Algorithmically complex residually finite groups