Related papers: The matrix-extended $W_{1+\infty}$ algebra
We show that the truncation of twisted Yangians are isomorphic to finite W-algebras based on orthogonal or symplectic algebras. This isomorphism allows us to classify all the finite dimensional irreducible representations of the quoted…
We present a self-contained account of Woodin's extender algebra and its use in proving absoluteness results, including a proof of the $\Sigma^2_1$-absoluteness theorem. We also include a proof that the existence of an inner model with…
We exhibit an isomorphism of associative algebras between the $\operatorname{Ext}$-algebra $\operatorname{Ext}_\Lambda^\ast(\Delta,\Delta)$ of standard modules over the dual extension algebra $\Lambda$ of two directed algebras $B$ and $A$…
Recently, Gaiotto and Rapcak (GR) proposed a new family of the vertex operator algebra (VOA) as the symmetry appearing at an intersection of five-branes to which they refer as Y algebra. Prochazka and Rapcak, then proposed to interpret Y…
We introduce a class of permutation centralizer algebras which underly the combinatorics of multi-matrix gauge invariant observables. One family of such non-commutative algebras is parametrised by two integers. Its Wedderburn-Artin…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
We propose a general algorithm of constructing an extended formulation for any given set of linear constraints with integer coefficients. Our algorithm consists of two phases: first construct a decision diagram $(V,E)$ that somehow…
In this paper we translate the necessary and sufficient conditions of Tanaka's theorem on the finiteness of effective prolongations of a fundamental graded Lie algebras into computationally effective criteria, involving the rank of some…
We describe a new method to compute general cubature formulae. The problem is initially transformed into the computation of truncated Hankel operators with flat extensions. We then analyse the algebraic properties associated to flat…
We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…
Quantum superalgebras $su_{q}(m\mid n)$ are studied in the framework of $R$-matrix formalism. Explicit parametrization of $L^{(+)}$ and $L^{(-)}$ matrices in terms of $su_{q}(m\mid n)$ generators are presented. We also show that quantum…
The commutative algebra of functions on a manifold is extended to a noncommutative algebra by considering its tensor product with the algebra of nxn complex matrices. Noncommutative geometry is used to formulate an extension of the…
We define a generalized form of $L_\infty$-algebras called $E_2L_\infty$-algebras. As we show, these provide the natural algebraic framework for generalized geometry and the symmetries of double field theory as well as the gauge algebras…
The Lie superalgebra SD of regular differential operators on the super circle has a universal central extension \hat{SD}. For each c\in C, the vacuum module M_c(\hat{SD}) of central charge c admits a vertex superalgebra structure, and…
We give an introduction to the Mathematica package Lambda, designed for calculating $\lambda$-brackets in both vertex algebras, and in SUSY vertex algebras. This is equivalent to calculating operator product expansions in two-dimensional…
In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…
By providing equivalent definitions of fractional Brauer configuration algebras in certain special cases, we associate to each monomial algebra some combinatorial data called a fractional Brauer configuration, from which we construct a…
Transformers can learn to perform numerical computations from examples only. I study nine problems of linear algebra, from basic matrix operations to eigenvalue decomposition and inversion, and introduce and discuss four encoding schemes to…
The loop equations in the $U(N)$ lattice gauge theory are represented in the form of constraints imposed on a generating functional for the Wilson loop correlators. These constraints form a closed algebra with respect to commutation. This…
A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…