No CrossRef data available.
Article contents
Graph varieties containing Murskii's groupoid
Published online by Cambridge University Press: 17 April 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
In this paper varieties are investigated which are generated by graph algebras of undirected graphs and—in most cases—contain Murskii's groupoid (that is the graph algebra of the graph with two adjacent vertices and one loop). Though these varieties are inherently nonfinitely based, they can be finitely based as graph varieties (finitely graph based) like, for example, the varitey generated by Murskii's groupoid. Many examples of nonfinitely based graph varities containing Murskii's groupoid are given, too. Moreover, the coatoms in the subvariety lattice of the graph variety of all undirected graphs are described. There are two coatoms and they are finitely graph based.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 1989
References
[1]Baker, K.A., McNulty, G.F. and Werner, H., ‘The finitely based varities of graph algebras’, Acta Sci. Math. (Szeged) 51 (1987), 3–15.Google Scholar
[2]Kiss, E.W., ‘A note on varieties of graph algebras’, in Universal Algebra and Lattice Theory, Proc. Charleston Conf. 1984, Lecture Notes in Math., 1149, pp. 163–166 (Springer-Verlag, Berlin, Heidelberg, New York, 1985).Google Scholar
[3]Kiss, E.W., Pöschel, R. and Pröhle, P., ‘Subvarieties of varieties generated by graph algebras’, Acta Sci. Math. (Szeged) (to appear).Google Scholar
[4]Kriegel, K., Pöschel, R. and Weasel, W., ‘The dimension of graphs with respect to the direct powers of a two-element graph’, Bull. Austral. Math. Soc. 36 (1987), 251–265.CrossRefGoogle Scholar
[5]McNulty, G.F. and Shallon, C., ‘Inherently nonfinitely based finite algebras’, in Universal Alge. bra and Lattice Theory, Proc. Puebla Conf. 1982, Lecture Notes in Math. 1004, pp. 206–231 (Springer-Verlag, Berlin, Heidelberg, New York, 1983).Google Scholar
[6]Murskii, V.L., ‘The existence in three-valued logic of a closed class with finite basis not having a finite complete system of identities’, Dokl. Akad. Nauk SSSR 163 (1965,), 815–818. (in Russian), Soviet Math. Dokl., 6 (1965) 1020–1024, (in English).Google Scholar
[7]Oates-Macdonald, S. and Vaughan-Lee, M., ‘Varieties that make one cross’, J. Austral. Math. Soc. Ser. A 26 (1978), 368–382.CrossRefGoogle Scholar
[8]Oates-Williams, S., ‘Murskii's algebra does not satisfy MIN’, Bull. Austral. Math. Soc. 22 (1980), 199–203.CrossRefGoogle Scholar
[9]Oates-Williams, S., ‘Graphs and universal algebras’, in Combinatorial Mathematics VIII, Proc. Geelong, Australia 1980 Lecture Notes in Math. 884, pp. 351–354, 1981.CrossRefGoogle Scholar
[10]Oates-Williams, S., ‘On the varieties generated by Murskii's algebra’, Algebra Universalis 18 (1984), 175–177.CrossRefGoogle Scholar
[11]Pöschel, R., ‘Graph algebras and graph varieties’, (manuscript 1985), Algebra Universalis. (submitted).Google Scholar
[12]Pöschel, R., ‘The equational logic for graph algebras’, ZML 35 (1989). (to appear).Google Scholar
[13]Pöschel, R. and Wessel, W., ‘Classes of graphs definable by graph algebra identities or quasi-identities’, Comment. Math. Univ. Carolin. 28 (1987), 581–592.Google Scholar
[14]Pouzet, M. and Rosenberg, I.G., ‘Embeddings and absolute retracts of relational systems’, in CRM-1265, Univ. de Montréal, 1985. (preprint)Google Scholar
[15]Shallon, C.R., Nonfinitely based finite algebras derived from lattices, Ph.D. Dissertation, University of California, Los Angles, 1979.Google Scholar
You have
Access