activity
20132022
most citedSupernilpotence Need Not Imply Nilpotence

2 citations · 9 across the 7 of their papers we have counts for

collaborators

8 papers

quant-ph2022

A Quantum Polynomial-Time Solution to The Dihedral Hidden Subgroup Problem

Matthew Moore, Grace Young

We present a polynomial-time quantum algorithm for the Hidden Subgroup Problem over . The usual approach to the Hidden Subgroup Problem relies on harmonic analysi…

cs.LO2020

The Hidden Subgroup Problem for Universal Algebras

Matthew Moore, Taylor Walenczyk

The Hidden Subgroup Problem (HSP) is a computational problem which includes as special cases integer factorization, the discrete logarithm problem, graph isomorphism, and the short…

cs.LO2018

Finite degree clones are undecidable

Matthew Moore

A clone of functions on a finite domain determines and is determined by its system of invariant relations (=predicates). When a clone is determined by a finite number of relations,…

math.RA2018★ 2 cited

Supernilpotence Need Not Imply Nilpotence

Matthew Moore, Andrew Moorhead

Supernilpotence is a generalization of nilpotence using a recently developed theory of higher-arity commutators for universal algebras. Many important structural properties have be…

math.RA2015★ 1 cited

Absorption and directed Jónsson terms

Alexandr Kazda, Marcin Kozik, Ralph McKenzie +1

We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witnes…

math.RA2014★ 2 cited

Naturally dualizable algebras omitting types 1 and 5 have a cube term

Matthew Moore

An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distribu…