Page 1 Next

Displaying 1 – 20 of 23

Showing per page

On connections between hypergraphs and algebras

Konrad Pióro (2000)

Archivum Mathematicum

The aim of the present paper is to translate some algebraic concepts to hypergraphs. Thus we obtain a new language, very useful in the investigation of subalgebra lattices of partial, and also total, algebras. In this paper we solve three such problems on subalgebra lattices, other will be solved in [[Pio4]]. First, we show that for two arbitrary partial algebras, if their directed hypergraphs are isomorphic, then their weak, relative and strong subalgebra lattices are isomorphic. Secondly, we prove...

On ideal extensions of partial monounary algebras

Danica Jakubíková-Studenovská (2008)

Czechoslovak Mathematical Journal

In the present paper we introduce the notion of an ideal of a partial monounary algebra. Further, for an ideal ( I , f I ) of a partial monounary algebra ( A , f A ) we define the quotient partial monounary algebra ( A , f A ) / ( I , f I ) . Let ( X , f X ) , ( Y , f Y ) be partial monounary algebras. We describe all partial monounary algebras ( P , f P ) such that ( X , f X ) is an ideal of ( P , f P ) and ( P , f P ) / ( X , f X ) is isomorphic to ( Y , f Y ) .

On JP-semilattices of Begum and Noor

Jānis Cīrulis (2013)

Mathematica Bohemica

In recent papers, S. N. Begum and A. S. A. Noor have studied join partial semilattices (JP-semilattices) defined as meet semilattices with an additional partial operation (join) satisfying certain axioms. We show why their axiom system is too weak to be a satisfactory basis for the authors' constructions and proofs, and suggest an additional axiom for these algebras. We also briefly compare axioms of JP-semilattices with those of nearlattices, another kind of meet semilattices with a partial join...

On some non-obvious connections between graphs and unary partial algebras

Konrad Pióro (2000)

Czechoslovak Mathematical Journal

In the present paper we generalize a few algebraic concepts to graphs. Applying this graph language we solve some problems on subalgebra lattices of unary partial algebras. In this paper three such problems are solved, other will be solved in papers [Pió I], [Pió II], [Pió III], [Pió IV]. More precisely, in the present paper first another proof of the following algebraic result from [Bar1] is given: for two unary partial algebras 𝐀 and 𝐁 , their weak subalgebra lattices are isomorphic if and only...

On subalgebra lattices of a finite unary algebra. I.

Konrad Pióro (2001)

Mathematica Bohemica

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 𝐀 , 𝐋 , where 𝐀 is a finite unary algebra and L a finite lattice such that the subalgebra lattice of 𝐀 is isomorphic to 𝐋 . Moreover, we find necessary and sufficient conditions for two arbitrary finite unary algebras to have isomorphic subalgebra lattices. We solve...

On subalgebra lattices of a finite unary algebra. II.

Konrad Pióro (2001)

Mathematica Bohemica

We use graph-algebraic results proved in [8] and some results of the graph theory to characterize all pairs 𝐋 1 , 𝐋 2 of lattices for which there is a finite partial unary algebra such that its weak and strong subalgebra lattices are isomorphic to 𝐋 1 and 𝐋 2 , respectively. Next, we describe other pairs of subalgebra lattices (weak and relative, etc.) of a finite unary algebra. Finally, necessary and sufficient conditions are found for quadruples 𝐋 1 , 𝐋 2 , 𝐋 3 , 𝐋 4 of lattices for which there is a finite unary algebra having...

Currently displaying 1 – 20 of 23

Page 1 Next