相关论文: Recursion relations and branching rules for simple…
Let $\mf{g}$ be any finite-dimensional Lie algebra with Killling form $B$. Let $\mf{h}$ be a subalgebra of $\mf{g}$ on which the Killing form is non degenerate. Then $\mf{h}$ is reductive.
We construct a subalgebra of the Hecke algebra of type A. This is a generalization of the group algebra of the alternating groups. All the equivalent classes of irreducible representations of the subalgebra and the q-analogue of the…
To any directed graph we associate an algebra with edges of the graph as generators and with relations defined by all pairs of directed paths with the same origin and terminus. Such algebras are related to factorizations of polynomials over…
The ideals of the Lie algebras of unitriangular polynomial derivations are classified. An isomorphism criterion is given for the Lie factor algebras of the Lie algebras of unitriangular polynomial derivations.
Continuing our attempt to explain the degeneracy of the genetic code using basic classical Lie superalgebras, we present the branching schemes for the typical codon representations (typical 64-dimensional irreducible representations) of…
We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…
We wish to understand how irreducible representations of a group G behave when restricted to a subgroup G' (the branching problem). Our primary concern is with representations of reductive Lie groups, which involve both algebraic and…
An oriented graph is said positively multiplicative when its adjacency matrix $A$ embeds in a matrix algebra admitting a basis $\mathsf{B}$ with nonnegative structure constants in which the matrix of the multiplication by $A$ coincides with…
In this note we study a family of algebras with one parameter defined by generators and relations. The set of generators contains the generators of the usual braids algebra, and another set of generators which is interpreted as ties between…
The first aim of this paper is to show that any finite-dimensional reductive Lie algebra and its finite-dimensional completely reducible representation can be embedded into some PC Lie algebra. The second aim is to find the structure of a…
We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…
When factorizing binary matrices, we often have to make a choice between using expensive combinatorial methods that retain the discrete nature of the data and using continuous methods that can be more efficient but destroy the discrete…
We derive basic scaling equations for relativistic magnetic reconnection in the general case of asymmetric inflow conditions and obtain predictions for the outflow Lorentz factor and the reconnection rate. Kinetic Particle-in-Cell…
We investigate linearity of amalgams of subgroups of algebraic groups along intersections with algebraic subgroups. In the process, we establish linearity of certain "doubles" of linear groups, and obtain new examples of finitely generated…
This survey describes probabilistic algorithms for linear algebra computations, such as factorizing matrices and solving linear systems. It focuses on techniques that have a proven track record for real-world problem instances. The paper…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
We describe a procedure, called regularisation, that allows us to study geometric structures on Lie algebroids via foliated geometric structures on a manifold of higher dimension. This procedure applies to various classes of Lie algebroids;…
On the level of Lie algebras, the contraction procedure is a method to create a new Lie algebra from a given Lie algebra by rescaling generators and letting the scaling parameter tend to zero. One of the most well-known examples is the…
We assume that every element of a matrix has a small, individual error, and model it by an external number, which is the sum of a nonstandard real number and a neutrix, the latter being a convex (external) set having the group property. The…