1 citations · 2 across the 2 of their papers we have counts for
3 papers
math.GR2016
Embedding of groups and quadratic equations over groups
Desmond F. Cummins, Sergei V. Ivanov
We prove that, for every integer , a finite or infinite countable group can be embedded into a 2-generated group in such a way that the solvability of quadratic eq…
math.GR2013★ 1 cited
Dehn Functions, the Word Problem, and the Bounded Word Problem For Decidable Group Presentations
Desmond Cummins
We construct examples of finitely generated decidable group presentations that satisfy certain combinations of solvability for the word problem, solvability for the bounded word pr…
math.LO2008★ 1 cited
Comparing Classes of Finite Structures
Wesley Calvert, Desmond Cummins, Sara Miller +1
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel red…