Related papers: Combining Semilattices and Semimodules

For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ordered set J(L) of join-irreducible elements of L and the join-dependency relation D\_L on J(L). We establish a similar version of this…

Let $\CaC\subset \Q^p$ be a rational cone. An affine semigroup $S\subset \CaC$ is a $\CaC$-semigroup whenever $(\CaC\setminus S)\cap \N^p$ has only a finite number of elements. In this work, we study the tree of $\CaC$-semigroups, give a…

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…

We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization…

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…

Based on the concept of weakly meet $s_{Z}$-continuouity put forward by Xu and Luo in \cite{qzm}, we further prove that if the subset system $Z$ satisfies certain conditions, a poset is $s_{Z}$-continuous if and only if it is weakly meet…

Monads play an important role in both the syntax and semantics of modern functional programming languages. The problem of combining them has been of profound interest at least since the 90s, and different approaches have been employed to…

We establish a relative monadicity theorem for relative monads with dense roots in a virtual equipment, specialising to a relative monadicity theorem for enriched relative monads. In particular, for a dense $\mathbb V$-functor $j \colon A…

Defining P* to be the complete lattice of upsets (ordered by reverse inclusion) of a poset P we give necessary and sufficient conditions on a subset S of P* for P to admit a meet-completion e from P to Q where e preserves the infimum of an…

We investigate non-semisimple modular categories with an eye towards a structure theory, low-rank classification, and applications to low dimensional topology and topological physics. We aim to extend the well-understood theory of…

We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…

Distributive laws give a way of combining two algebraic structures expressed as monads; in this paper we propose a theory of distributive laws for combining algebraic structures expressed as Lawvere theories. We propose four approaches,…

We study the group of group-like elements of a weak Hopf algebra and derive an analogue of Radford's formula for the fourth power of the antipode S, which implies that the antipode has a finite order modulo a trivial automorphism. We find a…

We study the notion of weak amalgamation in the context of diagonal conjugacy classes. Generalizing results of Kechris and Rosendal, we prove that for every countable structure $M$, Polish group $G$ of permutations of $M$, and $n \geq 1$,…

Let B be a p-block of the finite group G. We observe that the p-fusion of G constrains the module structure of B: Any basis of B that is invariant under the left and right multiplications of a chosen Sylow p-subgroup S of G must in fact…

Capretta's delay monad can be used to model partial computations, but it has the "wrong" notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the "right" notion of equality, weak bisimilarity.…

We relate weak distributive laws in SetMat to strictly associative (but not strictly unital) pseudoalgebras of the 2-monad (-)^2 on Cat. The corresponding orthogonal factorization systems are characterized by a certain bilinearity property.

A modular semilattice is a semilattice generalization of a modular lattice. We establish a Birkhoff-type representation theorem for modular semilattices, which says that every modular semilattice is isomorphic to the family of ideals in a…

Ceballos and Pons introduced the $s$-weak order on $s$-decreasing trees, for any weak composition $s$. They proved that it has a lattice structure and further conjectured that it can be realized as the $1$-skeleton of a polyhedral…