Proceedings of the American Mathematical Society · 2015 · 26 citations · 4 references
Natural SciencesComputer ScienceMathematicsAlgebraAlgorithmsAbstract AlgebraGroup TheoryCommutatorCommutator RelationsCommutator TheoryComputational Group TheoryFinite TimeNilpotent Groups
We show that there exists an algorithm to decide any single equation in the Heisenberg group in finite time. The method works for all two-step nilpotent groups with rank-one commutator, which includes the higher Heisenberg groups. We also prove that the decision problem for systems of equations is unsolvable in all non-abelian free nilpotent groups.
4
journal of Groups complexity cryptology · 2012 · 45 citations
Universal theory of nilpotent groups
Mathematical Notes · 1979 · 33 citations