Pages that link to "Item:Q5616882"
From MaRDI portal
The following pages link to A non-cyclic one-relator group all of whose finite quotients are cyclic (Q5616882):
Displaying 36 items.
- Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527) (← links)
- Largeness of LERF and 1-relator groups. (Q531907) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Large groups of deficiency 1. (Q1001403) (← links)
- Nilpotent groups with every finite homomorphic image cyclic (Q1096014) (← links)
- Solvable groups with certain finite homomorphic images cyclic (Q1109891) (← links)
- On one-relator groups which satisfy Poincaré duality (Q1142863) (← links)
- Small partial Latin squares that embed in an infinite group but not into any finite group (Q1680161) (← links)
- Algorithmically complex residually finite groups (Q1682244) (← links)
- General theory of groups (Q1845934) (← links)
- On the Bass-Lubotzky question about quotients of hyperbolic groups (Q1977544) (← links)
- Negative immersions for one-relator groups (Q2119897) (← links)
- Conjugacy search problem and the Andrews-Curtis conjecture (Q2305693) (← links)
- Sofic profile and computability of Cremona groups (Q2442195) (← links)
- Reflections on the residual finiteness of one-relator groups. (Q2472582) (← links)
- On the isomorphism of some groups with one defining relation. (Q2473632) (← links)
- The true prosoluble completion of a group: examples and open problems. (Q2642673) (← links)
- Space functions of groups (Q2841376) (← links)
- UNDECIDABILITY AND THE DEVELOPABILITY OF PERMUTOIDS AND RIGID PSEUDOGROUPS (Q2971054) (← links)
- A non-residually solvable hyperlinear one-relator group (Q2997198) (← links)
- Asymptotic invariants, complexity of groups and related problems (Q3143713) (← links)
- Automorphisms of higher rank lamplighter groups (Q3467631) (← links)
- FINITE COVERS OF THE INFINITE CYCLIC COVER OF A KNOT (Q3608724) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY (Q4649509) (← links)
- On the Finite Images of Some One-Relator Groups (Q4845924) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
- Proving Finitely Presented Groups are Large by Computer (Q4915380) (← links)
- The agrarian polytope of two‐generator one‐relator groups (Q5141877) (← links)
- Positive One-Relator Groups (Q5670807) (← links)
- On one-relator groups and units of special one-relation inverse monoids (Q5877774) (← links)
- Solved and unsolved problems (Q5915571) (← links)
- Complexity of word problems for HNN-extensions (Q5925702) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
- Uniform negative immersions and the coherence of one-relator groups (Q6203656) (← links)