Skip to main content Accessibility help
×
Home

Krohn-Rhodes complexity pseudovarieties are not finitely based

  • John Rhodes (a1) and Benjamin Steinberg (a2)

Abstract

We prove that the pseudovariety of monoids of Krohn-Rhodes complexity at most n is not finitely based for all n>0. More specifically, for each pair of positive integers n,k, we construct a monoid of complexity n+1, all of whose k-generated submonoids have complexity at most n.

Copyright

References

Hide All
[1] J. Almeida, Finite Semigroups and Universal Algebra. World Scientific, Singapore (1994).
[2] Almeida, J., Hyperdecidable pseudovarieties and the calculation of semidirect products. Internat. J. Algebra Comput. 9 (1999) 241261.
[3] Ash, C.J., Inevitable graphs: A proof of the Type II conjecture and some related decision procedures. Internat. J. Algebra Comput. 1 (1991) 127146.
[4] Austin, B., Henckell, K., Nehaniv, C. and Rhodes, J., Subsemigroups and complexity via the presentation lemma. J. Pure Appl. Algebra 101 (1995) 245289.
[5] S. Eilenberg, Automata, Languages and Machines. Academic Press, New York, Vol. A (1974); Vol. B (1976).
[6] Graham, R.L., On finite 0-simple semigroups and graph theory. Math. Syst. Theor. 2 (1968) 325339.
[7] K. Henckell, Idempotent pointlikes. Internat. J. Algebra Comput. (To appear).
[8] K. Henckell, Stable pairs. Internat. J. Algebra Comput. (Submitted).
[9] Henckell, K., Margolis, S., Pin, J.-E. and Rhodes, J., Ash's type II Theorem, profinite topology and Mal'cev products: Part I. Internat. J. Algebra Comput. 1 (1991) 411436.
[10] Krohn, K. and Rhodes, J., Algebraic theory of machines, I: Prime decomposition theorem for finite semigroups and machines. Trans. Amer. Math. Soc. 116 (1965) 450464.
[11] Krohn, K. and Rhodes, J., Complexity of finite semigroups. Ann. Math. 88 (1968) 128160.
[12] K. Krohn, J. Rhodes and B. Tilson, Lectures on the algebraic theory of finite semigroups and finite-state machines Chapters 1, 5–9 (Chapter 6 with M.A. Arbib), in The Algebraic Theory of Machines, Languages, and Semigroups, edited by M.A. Arbib. Academic Press, New York (1968).
[13] J.-E. Pin, Varieties of Formal Languages. Plenum, New York (1986).
[14] Rhodes, J., The fundamental lemma of complexity for arbitrary finite semigroups. Bull. Amer. Math. Soc. 74 (1968) 11041109.
[15] Rhodes, J., Kernel systems – A global study of homomorphisms on finite semigroups. J. Algebra 49 (1977) 145.
[16] Rhodes, J., Infinite iteration of matrix semigroups. I. Structure theorem for torsion semigroups. J. Algebra 98 (1986) 422451.
[17] Rhodes, J., Infinite iteration of matrix semigroups. II. Structure theorem for arbitrary semigroups up to aperiodic morphism. J. Algebra 100 (1986) 25137.
[18] J. Rhodes and B. Steinberg, Complexity pseudovarieties are not local; type II subsemigroups can fall arbitrarily in complexity. Internat. J. Algebra Comput. (Submitted).
[19] Rhodes, J. and Tilson, B., Lower bounds for complexity of finite semigroups. J. Pure Appl. Algebra 1 (1971) 7995.
[20] Rhodes, J. and Tilson, B., Improved lower bounds for the complexity of finite semigroups. J. Pure Appl. Algebra 2 (1972) 1371.
[21] Rhodes, J. and Tilson, B., A reduction theorem for complexity of finite semigroups. Semigroup Forum 10 (1975) 96114.
[22] J. Rhodes and B. Tilson, Local complexity of finite semigroups, in Algebra, Topology, and Category Theory (collection of papers in honor of Samuel Eilenberg). Academic Press, New York (1976) 149–168.
[23] Ribes, L. and Zalesskiĭ, P.A., On the profinite topology on a free group. Bull. London Math. Soc. 25 (1993) 3743.
[24] Steinberg, B., On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. J. Pure Appl. Algebra 186 (2004) 91107.
[25] B. Steinberg, On aperiodic relational morphisms. Semigroup Forum. (Accepted).
[26] Tilson, B., Decomposition and complexity of finite semigroups. Semigroup Forum 3 (1971) 189250.
[27] Tilson, B., Complexity of two- $\mathcal J$ -class semigroups. Adv. Math. 11 (1973) 215237.
[28] B. Tilson, Depth decomposition theorem. Chapter XI in [5]SS.
[29] B. Tilson, Complexity of semigroups and morphisms. Chapter XII in [5].
[30] B. Tilson, Presentation lemma... the short form. (Unpublished 1995).
[31] Y. Zalcstein, Group-complexity and reversals of finite semigroups. Math. Syst. Theor. 8 (1974/75) 235–242.

Keywords

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed