Related papers: Recursion relations and branching rules for simple…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
Relational Lattice is a succinct mathematical model for Relational Algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. In this paper we push relational lattice theory in two…
We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background knowledge. These ABA frameworks can be mapped onto logic…
We present a new method of analysis of associative algebras. This method bears a certain resemblance to the famous analysis of commutative $C^*$-algebras in which an important role is played by multiplicative functionals over the algebra.…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…
Let $\mathbb{K}$ be a field, $R$ be an associative and commutative $\mathbb{K}$-algebra and $L$ be a Lie algebra over $\mathbb{K}$. We give some descriptions of injections from $L$ to Lie algebra of $\mathbb{K}$-derivations of $R$ in the…
In 2014, Wolfgang Rump showed that there exists a correspondence between left nilpotent right R-braces and pre-Lie algebras. This correspondence, established using a geometric approach related to flat affine manifolds and affine torsors,…
The reciprocal Pascal matrix has entries $\binom{i+j}{j}^{-1}$. Explicit formullae for its LU-decomposition, the LU-decomposition of its inverse, and some related matrices are obtained. For all results, $q$-analogues are also presented.
The reciprocal square root is an important computation for which many very sophisticated algorithms exist (see for example \cite{863046,863031} and the references therein). In this paper we develop a simple differential compensation (much…
In this paper, we study three applications of recursion to problems in coding and random permutations. First, we consider locally recoverable codes with partial locality and use recursion to estimate the minimum distance of such codes. Next…
Generalising a previous work of Jiang and Sheng, a cohomology theory for differential Lie algebras of arbitrary weight is introduced. The underlying $L_\infty[1]$-structure on the cochain complex is also determined via a generalised version…
We establish some results about large restricted Lie algebras similar to those known in the Group Theory. As an application we use this group-theoretic approach to produce some examples of restricted as well as ordinary Lie algebras which…
The orbits of Weyl groups W(A(n)) of simple A(n) type Lie algebras are reduced to the union of orbits of the Weyl groups of maximal reductive subalgebras of A(n). Matrices transforming points of the orbits of W(An) into points of subalgebra…
We study branching laws for a classical group $G$ and a symmetric subgroup $H$. Our approach is through the {\it branching algebra}, the algebra of covariants for $H$ in the regular functions on the natural torus bundle over the flag…
We study the problem of matrix Lie algebra conjugacy. Lie algebras arise centrally in areas as diverse as differential equations, particle physics, group theory, and the Mulmuley--Sohoni Geometric Complexity Theory program. A matrix Lie…
Given a minuscule representation of a simple Lie algebra, we find an algebraic model for the action of a regular element and show that these models can be glued together over the adjoint quotient, viewed as the set of all regular conjugacy…
We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…
Finding the Lie-algebraic closure of a handful of matrices has important applications in quantum computing and quantum control. For most realistic cases, the closure cannot be determined analytically, necessitating an explicit numerical…
We give a full classification of Lie algebras of specific type in complexified Clifford algebras. These sixteen Lie algebras are direct sums of subspaces of quaternion types. We obtain isomorphisms between these Lie algebras and classical…
Using methods of computer algebra, especially Gr\"obner bases for submodules of free modules over polynomial rings, we solve a classification problem in theory of algebraic operads: we show that the only nontrivial (possibly inhomogeneous)…