Related papers: Join-semilattices whose principal filters are pseu…
Let $I$ be a non-empty set and $\mathcal{D}$ an ultrafilter over $I$. For similar algebraic structures $B_i$, $i\in I$ let $\Pi (B_i|i\in I)$ and $\Pi _{\mathcal{D}}(B_i|i\in I)$ denote the direct product and the ultraproduct of $B_i$,…
For a rank two root system and a pair of nonnegative integers, using only elementary combinatorics we construct two posets. The constructions are uniform across the root systems A1+A1, A2, C2, and G2. Examples appear in Figures 3.2 and 3.3.…
We show that the class of Contact join-semilattices, as introduced by T. Ivanova, is not finitely axiomatizable. On the other hand, a simple finite axiomatization exists for the class of those join semilattices with a weak contact relation…
We denote by Conc(A) the semilattice of all finitely generated congruences of an (universal) algebra A, and we define Conc(V) as the class of all isomorphic copies of all Conc(A), for A in V, for any variety V of algebras. Let V and W be…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
We prove a convolution formula for the conjugacy classes in symmetric groups conjectured by the second author. A combinatorial interpretation of coefficients is provided. As a main tool we introduce new semigroup of partial permutations. We…
In this paper we introduce the localization construction for quantales. A quantale is a complete semilattice combined with a multiplication. We mimic the notion of filter in a lattice to define multiplicative filters in a quantale, and…
The purpose of this article is to investigate the combinatorial properties of the cross section lattice of a $J$-irreducible monoid associated with a semisimple algebraic group of one of the types $A_n$, $B_n$, or $C_n$. Our main tool is a…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
Let $\Lambda$ be a finite dimensional algebra. In this paper we show that there is a natural bijection between cosilting modules in Mod$\Lambda$ and semibricks in Mod$\Lambda$ satisfying some condition. Also this bijection restricts to a…
This paper studies the combinatorics of lattice congruences of the weak order on a finite Weyl group $W$, using representation theory of the corresponding preprojective algebra $\Pi$. Natural bijections are constructed between important…
In recent work, comonads and associated structures have been used to analyse a range of important notions in finite model theory, descriptive complexity and combinatorics. We extend this analysis to Hybrid logic, a widely-studied extension…
Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…
Much study has been done on semigroups which are unions of groups. There are several ways in which a union of groups can be made into a semigroup in which each of the component groups arises as subgroups of the constructed semigroup. An…
This article gives an overview of some key categorical-algebraic properties of the variety of Heyting semilattices, with the aim of correcting a misconception in the literature. We confirm that the category of Heyting semilattices is not…
In this document we consider the prime spectrum of an MV-algebra with certain natural operations. These are used to show connections between the classes of prime lattice filters and prime implication filters.
We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…
Convex semilattices are algebras that are at the same time a convex algebra and a semilattice, together with a distributivity axiom. These algebras have attracted some attention in the last years as suitable algebras for probability and…
For a finite lattice L, let EL denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form EL, as follows:…
We investigate the initial segments of the Medvedev lattice as Brouwer algebras, and study the propositional logics connected to them.