Algebra Universalis最新文献

In this paper, type n lattice-ordered algebras are introduced and a characterization is given for those of type 0 and type 1. Moreover we investigate the question: Let A be a lattice-ordered algebra with unit element (e >0) in which every positive element has an inverse. Under what conditions A is lattice and algebra isomorphic to ({mathbb {R}}) ? We have shown that for certain algebras the question has a positive answer, generalizing thus a result of Scheffold. We also obtained a result similar to Edwards’ Theorem for normed lattice-ordered algebras.

In this paper we continue the study of edge-colored graphs associated with finite idempotent algebras initiated in [Bulatov, “Local structure of idempotent algebras I”, CoRR, abs/2006.09599, 2020.]. We prove stronger connectivity properties of such graphs that will allows us to demonstrate several useful structural features of subdirect products of idempotent algebras such as rectangularity and 2-decomposition.

We characterise the slices of the category of graphs that are algebraically universal in terms of the structure of the slicing graph. In particular, we show that algebraic universality is obtained if, and only if, the slicing graph contains one of four fixed graphs as a subgraph.

We generalize to (hbox {d}_{text {0}})-algebras a result of Riečanová about the decomposition of a D-lattice by means of a family of central elements.

In the framework of weak congruence lattices, many classes of groups have been characterized up to now, in completely lattice-theoretic terms. In this note, the center of the group is captured lattice-theoretically and nilpotent groups are characterized by lattice properties.

We study two families of lattices whose number of elements are given by the numbers in even (respectively odd) positions in the Fibonacci sequence. The even Fibonacci lattice arises as the lattice of simple elements of a Garside monoid partially ordered by left-divisibility, and the odd Fibonacci lattice is an order ideal in the even one. We give a combinatorial proof of the lattice property, relying on a description of words for the Garside element in terms of Schröder trees, and on a recursive description of the even Fibonacci lattice. This yields an explicit formula to calculate meets and joins in the lattice. As a byproduct we also obtain that the number of words for the Garside element is given by a little Schröder number.

In 1990, Johnstone gave a syntactic characterisation of the equational theories whose associated varieties are cartesian closed. Among such theories are all unary theories—whose models are sets equipped with an action by a monoid M—and all hyperaffine theories—whose models are sets with an action by a Boolean algebra B. We improve on Johnstone’s result by showing that an equational theory is cartesian closed just when its operations have a unique hyperaffine–unary decomposition. It follows that any non-degenerate cartesian closed variety is a variety of sets equipped with compatible actions by a monoid M and a Boolean algebra B; this is the classification theorem of the title.

We provide a simple natural duality for the varieties generated by the negation- and implication-free reduct of a finite MV-chain. We study these varieties through the dual equivalences thus obtained. For example, we fully characterize their algebraically closed, existentially closed and injective members. We also explore the relationship between this natural duality and Priestley duality in terms of distributive skeletons and Priestley powers.

A quasivariety (mathfrak N) is called relative congruence principal if, for every algebra (Ain mathfrak N), every compact (mathfrak N)-congruence on A is a principal (mathfrak N)-congruence. We characterize relative congruence principal quasivarieties in terms of one identity and two quasi-identities. We will use the characterization to show that there exists a continuum of relative congruence principal quasivarieties of algebras of a signature (sigma ), provided (sigma ) contains at least one operation of arity greater than 1. Several examples are provided.

The override operation (sqcup ) is a natural one in computer science, and has connections with other areas of mathematics such as hyperplane arrangements. For arbitrary functions f and g, (fsqcup g) is the function with domain ({{,textrm{dom},}}(f)cup {{,textrm{dom},}}(g)) that agrees with f on ({{,textrm{dom},}}(f)) and with g on ({{,textrm{dom},}}(g) backslash {{,textrm{dom},}}(f)). Jackson and the author have shown that there is no finite axiomatisation of algebras of functions of signature ((sqcup )). But adding operations (such as update) to this minimal signature can lead to finite axiomatisations. For the functional signature ((sqcup ,backslash )) where (backslash ) is set-theoretic difference, Cirulis has given a finite equational axiomatisation as subtraction o-semilattices. Define (fcurlyvee g=(fsqcup g)cap (gsqcup f)) for all functions f and g; this is the largest domain restriction of the binary relation (fcup g) that gives a partial function. Now (fcap g=fbackslash (fbackslash g)) and (fsqcup g=fcurlyvee (fcurlyvee g)) for all functions f, g, so the signatures ((curlyvee )) and ((sqcup ,cap )) are both intermediate between ((sqcup )) and ((sqcup ,backslash )) in expressive power. We show that each is finitely axiomatised, with the former giving a proper quasivariety and the latter the variety of associative distributive o-semilattices in the sense of Cirulis.