UofM logo  

Department of Mathematics
Server

Rings and Modules Seminar
~ Abstracts ~

R. Padmanabhan
padman(at)cc(dot)umanitoba(dot)ca

Department of Mathematics
University of Manitoba

Tuesday, November 15, 2011

Self-dual lattice equations
Abstract:

It is well-known that the self-dual class of all distributive lattices class is definable by the single self-dual equation xy+yz+zx = (x+y)(y+z)(z+x) and similarly the self-dual class of all modular lattices is definable by the self-dual equation (x+y)(z+xy) = xy + z(x+y). Given a finitely based self-dual variety of lattices, one might ask if it is definable by a single self-dual lattice equation (modulo, lattice theory). Making use of several methods for producing a single identity which is equivalent to a finite set of given identities, we show that there are infinitely many self-dual lattice varieties with "yes'' as the answer. In particular, we show that every finitely based self-dual subvariety of modular lattices is definable by a single self-dual equation. Also there are infinitely many finitely based self-dual lattice varieties which are not so definable. These results were obtained in collaboration with David Kelly.

  1. E. Gedeonovà, Jordan-Hölder theorem for lines, Mat. Časopis Sloven. Akad. Vied 22 (1972), 177–198.
  2. B. Jónsson, Algebras whose congruence lattices are distributive, Math. Scand. 21 (1967), 110–121
  3. B. Jónsson, The class of Arguesian lattices is self-dual, Algebra Universalis 2 (1972), 396.
  4. Kelly, David; Padmanabhan, R, Self-dual lattice identities. Algebra Universalis 48 (2002), no. 4, 413nmdash;426.
  5. R. McKenzie, Equational bases and nonmodular lattice varieties, Trans. Amer. Math. Soc. 174 (1972), 1nmdash;3.

Return to the Seminar page.
This page maintained by tkucera@cc.umanitoba.ca. Page © 2011 Thomas G. Kucera