Related papers: Reflexive combinatory algebras
Let $\mathbf{k}$ be an algebraically closed field, let $\Lambda$ be a finite dimensional $\mathbf{k}$-algebra, and let $\widehat{\Lambda}$ be the repetitive algebra of $\Lambda$. For the stable category of finitely generated left…
We construct the reflection functors for quiver Hecke algebras of an arbitrary symmetrizable Kac-Moody type. These reflection functors categorify Lusztig's braid symmetries.
We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…
Nontrivial combinatory algebras with S and K must be infinite. Associativity is incompatible with combining a classifier and a retraction pair in a finite extensional magma. These obstructions exclude several standard settings from the…
We introduce the concept of compact quantitative equational theory. A quantitative equational theory is defined to be compact if all its consequences are derivable by means of finite proofs. We prove that the theory of interpolative…
An algorithm is presented that generates sets of size equal to the degree of a given variety defined by a homogeneous ideal. This algorithm suggests a versatile framework to study various problems in combinatorial algebraic geometry and…
The standard generators of tridiagonal algebras, recently introduced by Terwilliger, are shown to generate a new (in)finite family of mutually commuting operators which extends the Dolan-Grady construction. The involution property relies on…
Reflexive homology is the homology theory associated to the reflexive crossed simplicial group; one of the fundamental crossed simplicial groups. It is the most general way to extend Hochschild homology to detect an order-reversing…
We give a necessary and sufficient smoothness condition for the scheme parameterizing the n-dimensional representations of a finitely generated associative algebra over an algebraically closed field of characteristic zero. In particular,…
Inspired by earlier works on representations of the Temperley-Lieb algebra we introduce a novel family of representations of the algebra. This may be seen as a generalization of the so called asymmetric twin representation. The underlying…
We aim at studying collections of algebraic structures defined over a commutative ring and investigating the complexity of significant constructions carried out on these objects. The assignment of measures of size, via a multiplicity…
The book "A Course in Constructive Algebra" (1988) shows the way of understanding classical basic algebra in a constructive style similar to Bishop's Constructive Mathematics. Classical theorems are revisited, with a new flavour, and become…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
For a set of sorts $S$ and an $S$-sorted signature $\Sigma$ we prove that a profinite $\Sigma$-algebra, i.e., a projective limit of a projective system of finite $\Sigma$-algebras, is a retract of an ultraproduct of finite $\Sigma$-algebras…
Pre-anti-flexible family algebras are introduced and linked with the notions of relative anti-flexible algebras, left and right pre-Lie family algebras and relative Lie algebras which are for mostly newly defined. Relative pre-anti-flexible…
We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…
Relational lattice is a formal mathematical model for Relational algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. We continue to investigate Relational lattice properties with…
We define reflective numbers and their iterative summations. We provide classification of reflective numbers based on their iterative cyclical limits.
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…