Related papers: The algebra of Boolean matrices, correspondence fu…
We classify all the simple modules for the algebra of relations on a finite set, give their dimension, and find the dimension of the Jacobson radical of the algebra.
We investigate correspondence functors, namely the functors from the category of finite sets and correspondences to the category of $k$-modules, where $k$ is a commutative ring.They have various specific properties which do not hold for…
Taking inspiration from the monadicity of complete atomic Boolean algebras, we prove that profinite modal algebras are monadic over Set. While analyzing the monadic functor, we recover the universal model construction - a construction…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…
We prove that the global dimension of the complex algebra of the monoid of all partial functions on an n-set is $n-1$ for all $n\geq 1$. This is also the global dimension of the complex algebra of the category of all epimorphisms between…
This paper is, essentially, a survey related to the problem of understanding the combinatorics of the action of the monoidal category of finite dimensional modules over a simple finite dimensional Lie algebra on various categories of Lie…
Algebraic logic studies algebraic theories related to proposition and first-order logic. A new algebraic approach to first-order logic is sketched in this paper. We introduce the notion of a quantifier theory, which is a functor from the…
Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for…
We study the monoid of so called projection functors $\p{S}$ attached to simple modules $S$ of a finite dimensional algebra, which appear naturally in the study of torsion pairs. We determine defining relations in special cases of path…
We study irreducible representations of two classes of conformal Galilei algebras in 1-spatial dimension. We construct a functor which transforms simple modules with nonzero central charge over the Heisenberg subalgebra into simple modules…
We classify canonical algebras such that for every dimension vector of a regular module the corresponding module variety is normal (respectively, a complete intersection). We also prove that for the dimension vectors of regular modules…
We introduce a new representation concept for lattices by boolean matrices, and utilize it to prove that any matroid is boolean representable. We show that such a representation can be easily extracted from a representation of the…
In this article the quantized matrix algebras as in the title have been studied at a root of unity. A full classification of simple modules over such quantized matrix algebras of rank $2$ along with a class of finite dimensional…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
We provide sufficient conditions for systems of polynomial equations over general (real or complex) algebras to have a solution. This generalizes known results on quaternions, octonions and matrix algebras. We also generalize the…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…