Related papers: Recursion relations and branching rules for simple…
Bosons and fermions are often written by elements of other algebras. M. Abe gave a recursive realization of the boson by formal infinite sums of the canonical generators of the Cuntz algebra ${\cal O}_{\infty}$. We show that such formal…
It is shown that the problem of calculating form factors in ADE affine Toda field theories can be reduced to the nonperturbative recursive calculation of polynomials symmetric in each sort of variables. We determine these recursion…
Convergent rewriting systems on algebraic structures give methods to solve decision problems, to prove coherence results, and to compute homological invariants. These methods are based on higher-dimensional extensions of the critical…
In this paper, first using the higher derived brackets, we give the controlling algebra of relative difference Lie algebras, which are also called crossed homomorphisms or differential Lie algebras of weight 1 when the action is the adjoint…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
We show that the general method of Lie algebra expansions can be applied to re-construct several algebras and related actions for non-relativistic gravity that have occurred in the recent literature. We explain the method and illustrate its…
The three-algebras used by Bagger and Lambert in N=6 theories of ABJM type are in one-to-one correspondence with a certain type of Lie superalgebras. We show that the description of three-algebras as generalized Jordan triple systems…
We give uniform formulas for the branching rules of level 1 modules over orthogonal affine Lie algebras for all conformal pairs associated to symmetric spaces. We also provide a combinatorial intepretation of these formulas in terms of…
The notion of defining relations is well-defined for any nilpotent Lie algebra. Therefore a conventional way to present a simple Lie algebra G is by splitting it into the direct sum of a commutative Cartan subalgebra and two maximal…
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
The FLAME methodology for deriving linear algebra algorithms from specification, first introduced around 2000, has been successfully applied to a broad cross section of operations. An open question has been whether it can yield algorithms…
We discuss existence of factorizations with linear factors for (left) polynomials over certain associative real involutive algebras, most notably over Clifford algebras. Because of their relevance to kinematics and mechanism science, we put…
The Z-grading determined by a long simple root of an affine or finite type Lie algebra arises from an adjoint or cominuscule representation of a lower rank semi-simple complex Lie algebra. Analysis of the relationship between the grading…
A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…
Derivations extend the concept of differentiation from functions to algebraic structures as linear operators satisfying the Leibniz rule. In Lie algebras, derivations form a Lie algebra via the commutator bracket of linear endomorphisms.…
A rigorous geometric proof of the Lie's Theorem on nonlinear superposition rules for solutions of non-autonomous ordinary differential equations is given filling in all the gaps present in the existing literature. The proof is based on an…
A procedure is described that makes use of the generating function of characters to obtain a new generating function $H$ giving the multiplicities of each weight in all the representations of a simple Lie algebra. The way to extract from…
It is natural for probabilistic programs to use conditionals to express alternative substructures in models, and loops (recursion) to express repeated substructures in models. Thus, probabilistic programs with conditionals and recursion…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
In this article, we introduce the concepts of excision and idealization for a multiplicative Lie algebra (also for a Lie algebra), which provides two new multiplicative Lie algebras (or Lie algebras) from a given multiplicative Lie algebra…