3-Filiform Leibniz algebras of maximum length, whose naturally graded algebras are Lie algebras

Camacho, L.M.; Cañete, E.M.; Gómez, José Manuel; Omirov, B. A.

doi:10.1080/03081087.2011.554416

Cited by 11 publications

(4 citation statements)

References 12 publications

(12 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…

…”

mentioning

confidence: 59%

“…In this way, we can distinguish two cases: the natural graded Lie algebras and the natural graded non-Lie algebras. The study of the first case was closed in [4], so we explain the results obtained in the second family. After that we will work with a homogeneous basis and we will assume that the associated gradation has maximum length.…”

Section: -Filiform Non-lie Leibniz Algebras Of Maximum Lengthmentioning

confidence: 90%

“…It should be remarked that the null-filiform case will not be studied because its extension always gives a standard algebra. The Lie case has already been done in [4], where the classification is presented in the following theorem: Theorem 2.3. Let L be a (n+1)-dimensional non standard 3-filiform Leibniz algebra whose associated naturally graded algebra is a Lie algebra.…”

Section: Split Casementioning

confidence: 99%

“…In this section we will restrict our study to classify the 3-filiform Leibniz algebras of maximum length, which are the extension of the non split and naturally graded non-Lie Leibniz algebras. The Lie case has been closed in [4], where there is not any non split 3-filiform Leibniz algebra of maximum length.…”

Section: Non Split Casementioning

confidence: 99%

See 3 more Smart Citations

3-filiform Leibniz algebras of maximum length

et al. 2016

View full text Add to dashboard Cite

This work completes the study of the solvable Leibniz algebras, more precisely, it completes the classification of the 3-filiform Leibniz algebras of maximum length [4]. Moreover, due to the good structure of the algebras of maximum length, we also tackle some of their cohomological properties. Our main tools are the previous result of Cabezas and Pastor [3], the construction of appropriate homogeneous basis in the considered connected gradation and the computational support provided by the two programs implemented in the software Mathematica.We will say that a Z-graded Leibniz algebra L admits a connected gradationLet us define the naturally graded algebras as follows:⊆ L i+j and we obtain the graded algebra grL. If grL and L are isomorphic, in notation grL ∼ = L, we say that L is a naturally graded algebra.The above constructed gradation is called natural gradation.Definition 1.2. The number l(⊕L) = l(V k1 ⊕ V k1+1 ⊕ · · · ⊕ V k1+t ) = t + 1 is called the length of the gradation, where ⊕L is a connected gradation. The gradation ⊕L has maximum length if l(⊕L) = dim(L).We define the length of an algebra L by: l(L) = max{l(⊕L) such that ⊕ L = V k1 ⊕ · · · ⊕ V kt is a connected gradation}. An algebra L is called of maximum length if l(L) = dim(L). The set R(L) = {x ∈ L : [y, x] = 0, ∀y ∈ L} is called the right annihilator of L. R x denotes the operator R x : L → L such that R x (y) = [y, x], ∀y ∈ L and it is called the right operator. The set Cent(L) = {z ∈ L : [x, z] = [z, x] = 0, ∀x ∈ L} is called the center of L.Let x be a nilpotent element of the set L \ L 2 . For the nilpotent operator R x we define a descending sequence C(x) = (n 1 , n 2 , . . . , n k ), which consists of the dimensions of the Jordan blocks of the operator R x . In the set of such sequences we consider the lexicographic order, that is, C(x) = (n 1 , n 2 , . . . , n k ) < C(y) = (m 1 , m 2 , . . . , m s ) if and only if there exists i ∈ N such that n j = m j for any j < i and n i < m i .Definition 1.3. The sequence C(L) = max C(x) x∈L\L 2 is called the characteristic sequence of the algebra L.

show abstract

“…

…”

mentioning

confidence: 59%

Section: -Filiform Non-lie Leibniz Algebras Of Maximum Lengthmentioning

confidence: 90%

Section: Split Casementioning

confidence: 99%

Section: Non Split Casementioning

confidence: 99%

See 2 more Smart Citations