Related papers: Graded Algebraic Theories
Profinite equations are an indispensable tool for the algebraic classification of formal languages. Reiterman's theorem states that they precisely specify pseudovarieties, i.e. classes of finite algebras closed under finite products,…
In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…
In The factorization of the Giry monad (arXiv:1707.00488v2) the author asserts that the category of convex spaces is equivalent to the category of Eilenberg-Moore algebras over the Giry monad. Some of the statements employed in the proof of…
There is a famous multiplication table of types of tensor product of two von Neumann algebras. We filled out the multiplication table of graded tensor product of two graded von Neumann algebras in special cases.
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the…
In this paper we introduce a new approach for organizing algebras of global dimension at most 2. We introduce the notion of cluster equivalence for these algebras, based on whether their generalized cluster categories are equivalent. We are…
Much of algebra and representation theory can be formulated in the general framework of tensor categories. The aim of this paper is to further develop this theory for braided tensor categories. Several results are established that do not…
We outline the theory of reflections for prederivators, derivators and stable derivators. In order to parallel the classical theory valid for categories, we outline how reflections can be equivalently described as categories of fractions,…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…
Graded modal types systems and coeffects are becoming a standard formalism to deal with context-dependent computations where code usage plays a central role. The theory of program equivalence for modal and coeffectful languages, however, is…
Considering tensor products of special commutative algebras and general real Clifford algebras, we arrive at extended Clifford algebras. We have found that there are five types of extended Clifford algebras. The class of extended Clifford…
We study graded symmetric algebras, which are the symmetric monoids in the monoidal category of vector spaces graded by a group. We show that a finite dimensional graded semisimple algebra is graded symmetric. The center of a symmetric…
We study classes of graded structures satisfying the properties of amalgamation, joint embedding and hereditariness. Given appropriate conditions, we can build a graded analogue of the Fraisse limit. Some examples such as the class of all…
We study geometric representation theory of Lie algebroids. A new equivalence relation for integrable Lie algebroids is introduced and investigated. It is shown that two equivalent Lie algebroids have equivalent categories of infinitesimal…
We investigate the notion of associated graded coalgebra (algebra) of a bialgebra with respect to a subbialgebra (quotient bialgebra) and characterize those which are bialgebras of type one in the framework of abelian braided monoidal…
We develop the theory of relative monads and relative adjunctions in a virtual equipment, extending the theory of monads and adjunctions in a 2-category. The theory of relative comonads and relative coadjunctions follows by duality. While…
Relative monads provide a controlled view of computation. We generalise the monadic metalanguage to a relative setting and give a complete semantics with strong relative monads. Adopting this perspective, we generalise two existing program…
The well-known Lawvere category R of extended real positive numbers comes with a monoidal closed structure where the tensor product is the sum. But R has another such structure, given by multiplication, which is *-autonomous. Normed sets,…
The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…