On subalgebra lattices of a finite unary algebra. II.
نویسندگان
چکیده
منابع مشابه
On Subalgebra Lattices of a Finite Unary Algebra Ii
We use graph-algebraic results proved in [8] and some results of the graph theory to characterize all pairs 〈L1,L2〉 of lattices for which there is a finite partial unary algebra such that its weak and strong subalgebra lattices are isomorphic to L1 and L2, respectively. Next, we describe other pairs of subalgebra lattices (weak and relative, etc.) of a finite unary algebra. Finally, necessary a...
متن کاملOn Subalgebra Lattices of a Finite Unary Algebra I
One of the main aims of the present and the next part [15] is to show that the theory of graphs (its language and results) can be very useful in algebraic investigations. We characterize, in terms of isomorphisms of some digraphs, all pairs 〈A,L〉, where A is a finite unary algebra and L a finite lattice such that the subalgebra lattice of A is isomorphic to L. Moreover, we find necessary and su...
متن کاملSubalgebra Lattices of a Partial Unary Algebra
Necessary and sufficient conditions will be found for quadruples of lattices to be isomorphic to lattices of weak, relative, strong subalgebras and initial segments, respectively, of one partial unary algebra. To this purpose we will start with a characterization of pairs of lattices that are weak and strong subalgebra lattices of one partial unary algebra, respectively. Next, we will describe ...
متن کاملAn Infinite C*-algebra with a Dense, Stably Finite *-subalgebra
We construct a unital pre-C*-algebra A0 which is stably finite, in the sense that every left invertible square matrix over A0 is right invertible, while the C*-completion of A0 contains a non-unitary isometry, and so it is infinite. To appear in Proceedings of the American Mathematical Society.
متن کاملHow Finite is a Three-Element Unary Algebra?
A full duality gives us a natural dual equivalence between a quasi-variety generated by a finite algebra and a class of structured topological spaces. There are many well-known examples of full dualities: Stone’s duality for Boolean algebras [12], Priestley’s duality for distributive lattices [11], and the Hofmann, Mislove, Stralka duality for semilattices [6]. A finite algebra M is called full...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Bohemica
سال: 2001
ISSN: 0862-7959,2464-7136
DOI: 10.21136/mb.2001.133927