**
MATHEMATICA BOHEMICA, Vol. 126, No. 1, pp. 161-170 (2001)
**

# On subalgebra lattices of a finite unary algebra I

## Konrad Pioro

* Konrad Pioro*, Institute of Mathematics, Warsaw University, ul. Banacha 2, PL-02-097 Warsaw, Poland, e-mail: ` kpioro@mimuw.edu.pl`

**Abstract:**
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 $\langle \mathbf {A},\mathbf {L}\rangle$, where $\mathbf {A}$ is a finite unary algebra and $\Cal L$ a finite lattice such that the subalgebra lattice of $\mathbf {A}$ is isomorphic to $\mathbf {L}$. Moreover, we find necessary and sufficient conditions for two arbitrary finite unary algebras to have isomorphic subalgebra lattices. We solve these two problems in the more general case of partial unary algebras. \endgraf In the next part [15] we will use these results to describe connections between various kinds of lattices of (partial) subalgebras of a finite unary algebra.

**Keywords:** unary algebra, partial algebra, subalgebra lattice, directed graph

**Classification (MSC2000):** 05C20, 05C40, 05C99, 08A30, 08A60, 05C90, 06B15, 06D05, 08A55

**Full text of the article:**

[Previous Article] [Next Article] [Contents of this Number]

*
© 2005 ELibM and
FIZ Karlsruhe / Zentralblatt MATH
for the EMIS Electronic Edition
*