Related papers: Convexity via Weak Distributive Laws

A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…

We completely characterize $\Delta$- and local subexponentialities of positive-half compound Poisson distributions and extend the characterization on two-sided distributions. Moreover, $\Delta$-subexponentiality of infinitely divisible…

We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach…

Distributive laws of a monad T over a functor F are categorical tools for specifying algebra-coalgebra interaction. They proved to be important for solving systems of corecursive equations, for the specification of well-behaved structural…

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 compute the domination monoid in the theory DMT of dense meet-trees. In order to show that this monoid is well-defined, we prove weak binarity of DMT and, more generally, of certain expansions of it by binary relations on sets of open…

A well-known challenge in the semantics of programming languages is how to combine non-determinism and probability. At a technical level, the problem arises from the fact that there is a no distributive law between the powerset monad and…

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 give a definition of weak morphism of $T$-algebras, for a $2$-monad $T$, with respect to an arbitrary family $\Omega$ of $2$-cells of the base $2$-category. By considering particular choices of $\Omega$, we recover the concepts of lax,…

Distributive laws of set functors over the powerset monad (also known as Kleisli laws for the powerset monad) are well-known to be in one-to-one correspondence with extensions of set functors to functors on the category of sets and…

We introduce the notion of a distributive law between a relative monad and a monad. We call this a relative distributive law and define it in any 2-category $\mathcal{K}$. In order to do that, we introduce the 2-category of relative monads…

We investigate the notion of involutive weak globular $\omega$-categories via Jacque Penon's approach. In particular, we give the constructions of a free self-dual globular $\omega$-magma, of a free strict involutive globular…

Clustering is well-known to play a prominent role in the description and understanding of complex networks, and a large spectrum of tools and ideas have been introduced to this end. In particular, it has been recognized that the abundance…

Motivated by the study of weak identity structures in higher category theory we explore the fat Delta category, a modification of the simplex category introduced by J. Kock. We provide a comprehensive study of fat Delta via the theory of…

In the first part of this article, we give an analysis of the free monad sequence in non-cocomplete categories, with the needed colimits explicitly parametrized. This enables us to state a more finely grained functoriality principle for…

A method for constructing distributions on the non negative integers as discrete analogue of continuous distributions on the non negative real is presented. A justification of the definition of discrete self decomposable laws is provided.…

We show that first-order logic can be translated into a very simple and weak logic, and thus set theory can be formalized in this weak logic. This weak logical system is equivalent to the equational theory of Boolean algebras with three…

The notion of $\Delta$-weakly mixing set is introduced, which shares similar properties of weakly mixing sets. It is shown that if a dynamical system has positive topological entropy, then the collection of $\Delta$-weakly mixing sets is…