A finitely presented orderable group with insoluble word problem
V. V. Bludov, A. M. W. Glass
TL;DR
This paper constructs a finitely presented, totally orderable group that has an insoluble word problem, demonstrating a complex interplay between orderability and computational complexity in group theory.
Contribution
It introduces the first known finitely presented, orderable group with an insoluble word problem, expanding understanding of algebraic and computational properties.
Findings
Existence of finitely presented orderable groups with insoluble word problem
Demonstrates complexity within algebraic structures with orderability
Advances the study of decision problems in group theory
Abstract
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.