Related papers: Quotients in monadic programming: Projective algeb…
Monads are of interest both in semantics and in higher dimensional algebra. It turns out that the idea behind usual notion finitary monads (whose values on all sets can be computed from their values on finite sets) extends to a more general…
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…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field, and ${\Bbb S}$ a finite sequence of simple left $\Lambda$-modules. In [6, 9], quasiprojective algebraic varieties with accessible affine open covers were…
Monoidal computer is a categorical model of intensional computation, where many different programs correspond to the same input-output behavior. The upshot of yet another model of computation is that a categorical formalism should provide a…
It came to the attention of myself and the coauthors of (S., Rozowski, Silva, Rot, 2022) that a number of process calculi can be obtained by algebraically presenting the branching structure of the transition systems they specify. Labelled…
We study the geometry of $\mathcal{Q}$-conic arrangements in the complex projective plane. These are arrangements consisting of smooth conics and they admit certain quasi-homogeneous singularities. We show that such $\mathcal{Q}$-conic…
Interviews run on people, programs run on operating systems, voting schemes run on voters, games run on players. Each of these is an example of the abstraction pattern runs on matter. Pattern determines the decision tree that governs how a…
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.…
In this paper, a monad-based denotational model is introduced and shown adequate for the Proto-Quipper family of calculi, themselves being idealized versions of the Quipper programming language. The use of a monadic approach allows us to…
In this thesis, we generalize the Koszul duality for associative algebras and operads to PROPs. The operads are algebraic objects that represent the operations with multiple inputs but only one output acting on a certain type of algebras. A…
In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…
Abstract clones serve as an algebraic presentation of the syntax of a simple type theory. From the perspective of universal algebra, they define algebraic theories like those of groups, monoids and rings. This link allows one to study the…
Arithmetic quotients are quotients of bounded symmetric domains by arithmetic groups, and modular subvarieties of arithmetic quotients are themselves arithmetic quotients of lower dimension which live on arithmetic quotients, by an…
Each vector space that is endowed with a quadratic form determines its Clifford algebra. This algebra, in turn, contains a distinguished group, known as the Lipschitz group. We show that only a quotient of this group remains meaningful in…
We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…
Let $K\langle X\rangle =K\langle X_1,...,X_n\rangle$ be the free algebra of $n$ generators over a field $K$, and let $R\langle X\rangle =R\langle X_1,...,X_n\rangle$ be the free algebra of $n$ generators over an arbitrary commutative ring…
We introduce a notion of signature whose sorts form a direct category, and study computads for such signatures. Algebras for such a signature are presheaves with an interpretation of every function symbol of the signature, and we describe…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
In this paper we examine how the notion of algebra of quotients for Lie algebras ties up with the corresponding well-known concept in the associative case. Specifically, we completely characterize when a Lie algebra $Q$ is an algebra of…