Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T06:47:11.747Z Has data issue: false hasContentIssue false

Krohn-Rhodes complexity pseudovarieties are not finitely based

Published online by Cambridge University Press:  15 March 2005

John Rhodes
Affiliation:
Department of Mathematics, University of California at Berkeley, Berkeley, CA 94720, USA; rhodes@math.berkeley.edu
Benjamin Steinberg
Affiliation:
School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada; bsteinbg@math.carleton.ca
Get access

Abstract

We prove that the pseudovariety of monoids of Krohn-Rhodescomplexity at most n is not finitely based for all n>0. Morespecifically, for each pair of positive integers n,k, weconstruct a monoid of complexity n+1, all of whose k-generatedsubmonoids have complexity at most n.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable