Complemented congruences on Ockham algebras

An Ockham algebra that satisfies the identity is called a K_{n, m}-algebra. Generalizing some results obtained in [2], J. Varlet and T. Blyth, in [3, Chapter 8], study congruences on K_{1, 1}-algebras. In particular, they describe the complement (when it exists) of a principal congruence and characterize these congruences that are complemented. In this paper we study the same question for K_{n, m}-algebras. Received March 24, 2005; accepted in final form April 28, 2005.     

Finite modular congruence lattices

We consider the variety of modular lattices generated by all finite lattices obtained by gluing together some M₃’s. We prove that every finite lattice in this variety is the congruence lattice of a suitable finite algebra (in fact, of an operator group). Received February 26, 2004; accepted in final form December 16, 2004.     

Congruence kernels of orthomodular implication algebras

Abstracting from certain properties of the implication operation in Boolean algebras leads to so-called orthomodular implication algebras. These are in a natural one-to-one correspondence with families of orthomodular lattices. It is proved that congruence kernels of orthomodular implication algebras are in a natural one-to-one correspondence with families of compatible p-filters on the corresponding orthomodular lattices.     

Greechie diagrams of orthomodular partial algebras

Greechie diagrams are well known graphical representations of orthomodular partial algebras, orthomodular posets and orthomodular lattices. For each hypergraph D a partial algebra ⟦D⟧ = (A; ⊕, ′, 0) of type (2,1,0) can be defined. A Greechie diagram can be seen as a special hypergraph: different points of the hypergraph have different interpretations in the corresponding partial algebra ⟦D⟧, and each line in the hypergraph has a maximal Boolean subalgebra as interpretation, in which the points are the atoms. This paper gives some generalisations of the characterisations in [K83] and [D84] of diagrams which represent orthomodular partial algebras (= OMAs), and we give an algorithm how to check whether a given hypergraph D is an OMA-diagram whose maximal Boolean subalgebras are induced by the lines of the hypergraph. Received July 22, 2004; accepted in final form February 1, 2007.     

Subalgebras of closure algebras

Closure algebras have been intensively studied in literature ([2], [3], [11], ...) but, up to now, little interest has been devoted to subalgebras of closure algebras. In this paper, the methods of [16] are adapted to characterize closure algebras with a distributive, or a Boolean, subalgebra lattice.     

Endomorphisms of relatively free algebras with weak exchange properties

The structure of the endomorphism monoid of a stable basis algebra A is described. It is shown to be an abundant monoid; the subsemigroup of endomorphisms of finite rank has a regular semigroup of left quotients.     

Topological duality for Tarski algebras

In this paper we will generalize the representation theory developed for finite Tarski algebras given in [7]. We will introduce the notion of Tarski space as a generalization of the notion of dense Tarski set, and we will prove that the category of Tarski algebras with semi-homomorphisms is dually equivalent to the category of Tarski spaces with certain closed relations, called T-relations. By these results we will obtain that the algebraic category of Tarski algebras is dually equivalent to the category of Tarski spaces with certain partial functions. We will apply these results to give a topological characterization of the subalgebras. Received August 21, 2005; accepted in final form December 5, 2006.     

On well-ordered mono-unary algebras

Given a linearly ordered set (A, _R ) and an R-monotone function f: AA, we give a necessary and sufficient condition on A, f, _R , involving generating sets and forbidden subalgebras, for _R to be a well-ordering.Partially supported by Hungarian National Foundation for Scientific Research Grant nr. 1813.     

Injectives in residuated algebras

Injectives in several classes of structures associated with logic are characterized. Among the classes considered are residuated lattices, MTL-algebras, IMTL-algebras, BL-algebras, NM-algebras and bounded hoops.     

A cofinal coloring theorem for partially ordered algebras

If P is a directed partially ordered algebra of an appropriate sort-e.g. an upper semilattice-and has no maximal element, then P has two disjoint subalgebras each cofinal in P. In fact, if P has cofinality then there exists a family of such disjoint subalgebras. A version of this result is also proved without the directedness assumption, in which the cofinality of P is replaced by an invariant which we call its global cofinality.This work was done while the first author was partly supported by NSF contract MCS 82-02632.     

On the nonexistence of free complete distributive lattices

We prove that there is no free object over a countable set in the category of complete distributive lattices with homomorphisms preserving binary meets and arbitrary joins.     

Some results on embeddings of algebras, after de Bruijn and McKenzie

In 1957, N.G. de Bruijn showed that the symmetric group Sym(Ω) on an infinite set Ω contains a free subgroup on 2^card(Ω) generators, and proved a more general statement, a sample consequence of which is that for any group A of cardinality card(Ω), the group Sym(Ω) contains a coproduct of 2^card(Ω) copies of A, not only in the variety of all groups, but in any variety of groups to which A belongs. His key lemma is here generalized to an arbitrary variety of algebras V, and formulated as a statement about functors Set V. From this one easily obtains analogs of the results stated above with “group” and Sym(Ω) replaced by “monoid” and the monoid Self(Ω) of endomaps of Ω, by “associative K-algebra” and the K-algebra End_K (V) of endomorphisms of a K-vector-space V with basis Ω, and by “lattice” and the lattice Equiv(Ω) of equivalence relations on Ω. It is also shown, extending another result from de Bruijn's 1957 paper, that each of Sym(Ω), Self(Ω) and End_K(V) contains a coproduct of 2^card(Ω) copies of itself.That paper also gave an example of a group of cardinality 2^card(Ω) that was not embeddable in Sym(Ω), and R. McKenzie subsequently established a large class of such examples. Those results are shown here to be instances of a general property of the lattice of solution sets in Sym(Ω) of sets of equations with constants in Sym(Ω). Again, similar results - this time of varying strengths - are obtained for Self(Ω), End_K(V), and Equiv(Ω), and also for the monoid Rel(Ω) of binary relations on Ω.Many open questions and areas for further investigation are noted.     

Rota-Baxter algebras and dendriform algebras

In this paper we study the adjoint functors between the category of Rota-Baxter algebras and the categories of dendriform dialgebras and trialgebras. In analogy to the well-known theory of the adjoint functor between the category of associative algebras and Lie algebras, we first give an explicit construction of free Rota-Baxter algebras and then apply it to obtain universal enveloping Rota-Baxter algebras of dendriform dialgebras and trialgebras. We further show that free dendriform dialgebras and trialgebras, as represented by binary planar trees and planar trees, are canonical subalgebras of free Rota-Baxter algebras.     

A combinatorial characterization of normalizations of Boolean algebras

In this paper we prove that if a groupoid has exactly distinct n-ary term operations for n=1, 2, 3 and the same number of constant unary term operations for n=0, then it is a normalization of a nontrivial Boolean algebra. This, together with some general facts concerning normalizations of algebras, which we recall, yields a clone characterization of normalizations of nontrivial Boolean algebras: A groupoid (G;·) is clone equivalent to a normalization of a nontrivial Boolean algebra if and only if the value of the free spectrum for (G;·) is for n = 0, 1, 2, 3. In the last section the Minimal Extension Property for the sequence (2, 3) in the class of all groupoids is derived. Received September 15, 2004; accepted in final form October 4, 2005.     

A note on atomistic weak congruence lattices

It is proved that a codistributive element in an atomistic algebraic lattice has a complement, implying that kernels of the related homomorphisms coincide. Some applications to weak congruence lattices of algebras are presented. In particular, necessary and sufficient conditions under which the weak congruence lattice of an algebra is atomistic are given.     

Algebraic lattices and Boolean algebras

In this paper we establish several equivalent conditions for an algebraic lattice to be a finite Boolean algebra. This paper is dedicated to Walter Taylor. Received February 11, 2005; accepted in final form October 9, 2005.     

Quasi injectivity and θ-internal order sum in partially ordered acts

Injectivity (weakly injectivity) of objects is an important concept which category theory inherited from homological and commutative algebra. One of the useful kinds of weakly injectivity is quasi injectivity. In this paper, we study the relation between different kinds of quasi injectivity and the concept of θ-internal order sum in the category of actions of an ordered monoid on ordered sets and some of its important subcategories. From the results obtained, we investigated the relations between these types of quasi injectivity.     

Higher level affine Schur and Hecke algebras

We define a higher level version of the affine Hecke algebra and prove that, after completion, this algebra is isomorphic to a completion of Webster's tensor product algebra of type A. We then introduce a higher level version of the affine Schur algebra and establish, again after completion, an isomorphism with the quiver Schur algebra. An important observation is that the higher level affine Schur algebra surjects to the Dipper-James-Mathas cyclotomic q-Schur algebra. Moreover, we give nice diagrammatic presentations for all the algebras introduced in this paper.