Related papers: Affine Standard Lyndon words: A-type
For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of…
We interpret and develop a theory of loop algebras as torsors (principal homogeneous spaces) over Laurent polynomial rings . As an application, we recover Kac's realization of affine Kac-Moody Lie algebras.
Logic program transformation by the unfold/fold method ad- vocates the writing of correct logic programs via the application of some rules to a naive program. This work focuses on how to overcome subgoal- introduction difficulties in…
Known classification results allow us to find the number of (equivalence classes of) fine gradings on matrix algebras and on classical simple Lie algebras over an algebraically closed field $\mathbb{F}$ (assuming $\mathrm{char}…
In this short note, we first associate a new simple undirected graph with a given word over an ordered alphabet of $n$-letters. We will call it the Lyndon graph of that word. Then, we introduce the concept of the Lyndon-word representable…
We construct the Lafforgue variety, an affine scheme equipped with an open dense subscheme parametrizing the simple modules of a non-commutative unital algebra $R$ over any field $k$, provided that the center $Z(R)$ is finitely generated…
In this paper we compare two finite words $u$ and $v$ by the lexicographical order of the infinite words $u^\omega$ and $v^\omega$. Informally, we say that we compare $u$ and $v$ by the infinite order. We show several properties of Lyndon…
For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a…
We construct a family of exact functors from the BGG category of representations of the Lie algebra sl to the category of finite-dimensional representations of the degenerate (or graded) affine Hecke algebra H of GL. These functors…
We have reviewed some results on quantized shuffling, and in particular, the grading and structure of this algebra. In parallel, we have summarized certain details about classical shuffle algebras, including Lyndon words (primes) and the…
In [4] we describe a variation of the classical permutation decoding algorithm that can be applied to any binary affine-invariant code; in particular, it can be applied to first-order Reed-Muller codes successfully. In this paper we study…
By using the known description of combinatorial bases for Feigin-Stoyanovsky's type subspaces of standard modules for affine Lie algebra $\mathfrak{sl}(l+1,\mathbb{C})^{\widetilde{}}$, as well as certain intertwining operators between…
Let $L^0$ be the algebra of equivalence classes of real valued random variables on a given probability space, and $(L^0)^n$ the $n$-ary Cartesian power of $L^0$ for each integer $n\geq 2$. We consider $(L^0)^n$ as a free module over $L^0$…
We classify up to isomorphism the gradings by arbitrary groups on the exceptional classical simple Lie superalgebras $G(3)$, $F(4)$ and $D(2,1;\alpha)$ over an algebraically closed field of characteristic $0$. To achieve this, we apply the…
It is shown that for finding rational approximates to m'th root of any integer to any accuracy one only needs the ability to count and to distinguish between m different classes of objects. To every integer N can be associated a…
We prove a precise formula for the minimal number K(n) such that every binary word of length $n$ can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the…
We define the pattern fragment for higher-order unification problems in linear and affine type theory and give a deterministic unification algorithm that computes most general unifiers.
Associated to the classical Weyl groups, we introduce the notion of degenerate spin affine Hecke algebras and affine Hecke-Clifford algebras. For these algebras, we establish the PBW properties, formulate the intertwiners, and describe the…