scholarly journals Leibniz algebras: a brief review of current results

2019 ◽  
Vol 11 (2) ◽  
pp. 250-257
Author(s):  
V.A. Chupordia ◽  
A.A. Pypka ◽  
N.N. Semko ◽  
V.S. Yashchuk
Keyword(s):  
Leibniz Algebra ◽  
Infinite Dimensional ◽  
Binary Operations ◽  
Leibniz Algebras ◽  
Finite Dimensional ◽  
Algebra Over A Field

Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[\cdot,\cdot]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity $[[a,b],c]=[a,[b,c]]-[b,[a, c]]$ for all $a,b,c\in L$. This paper is a brief review of some current results, which related to finite-dimensional and infinite-dimensional Leibniz algebras.

scholarly journals Varieties of Null-Filiform Leibniz Algebras Under the Action of Hopf Algebras

2021 ◽  
Author(s):  
Lucio Centrone ◽  
Chia Zargeh
Keyword(s):  
Hopf Algebra ◽  
Free Algebra ◽  
Hopf Algebras ◽  
Leibniz Algebra ◽  
Module Structure ◽  
Leibniz Algebras ◽  
Finite Dimensional ◽  
Filiform Leibniz Algebra ◽  
Algebra Over A Field ◽  
Cocommutative Hopf Algebra

AbstractLet L be an n-dimensional null-filiform Leibniz algebra over a field K. We consider a finite dimensional cocommutative Hopf algebra or a Taft algebra H and we describe the H-actions on L. Moreover we provide the set of H-identities and the description of the Sn-module structure of the relatively free algebra of L.

Finite-dimensional Leibniz algebras and combinatorial structures

2017 ◽  
Vol 20 (01) ◽  
pp. 1750004 ◽  
Author(s):  
M. Ceballos ◽  
J. Núñez ◽  
Á. F. Tenorio
Keyword(s):  
Leibniz Algebra ◽  
Combinatorial Structure ◽  
Combinatorial Structures ◽  
Leibniz Algebras ◽  
Finite Dimensional ◽  
Dimension 2

Given a finite-dimensional Leibniz algebra with certain basis, we show how to associate such algebra with a combinatorial structure of dimension 2. In some particular cases, this structure can be reduced to a digraph or a pseudodigraph. In this paper, we study some theoretical properties about this association and we determine the type of Leibniz algebra associated to each of them.

scholarly journals Interlacing methods and large indecomposables

1970 ◽  
Vol 3 (3) ◽  
pp. 337-348 ◽  
Author(s):  
S. E. Dickson ◽  
G. M. Kelly
Keyword(s):  
Artinian Ring ◽  
Finite Dimensional Algebra ◽  
Finitely Generated ◽  
Dimensional Algebra ◽  
Infinite Dimensional ◽  
Direct Sum ◽  
Number Of Generators ◽  
Finite Dimensional ◽  
Factor Module ◽  
Algebra Over A Field

The method of interlacing of modules, like amalgamation of groups, is a way of getting new objects from old. Briefly, the interlacing module we consider is a certain factor module of a direct sum of copies (finite or infinite) of an original module M. The conditions given in a previous paper by the first author in order that the interlacing module (using finitely many copies) be indecomposable are here greatly weakened, and we further allow the number of copies of the original to be infinite. R. Colby has shown that if R is a left artinian ring, the existence of a bound on the number of generators required for any indecomposable finitely-generated left R-module implies that R has a distributive lattice of two-sided ideals. This result is extended to rings whose identity is a sum of orthogonal local idempotents.For these rings the same distributivity is proved in case every indecomposable interlacing module of the above type which begins with an indecomposable projective M is finitely-generated. A consequence is that any finite-dimensional algebra over a field having infinitely many two-sided ideals has infinite-dimensional indecomposables.

scholarly journals An FDA-Based Approach for Clustering Elicited Expert Knowledge

Stats ◽  
2021 ◽  
Vol 4 (1) ◽  
pp. 184-204
Author(s):  
Carlos Barrera-Causil ◽  
Juan Carlos Correa ◽  
Andrew Zamecnik ◽  
Francisco Torres-Avilés ◽  
Fernando Marmolejo-Ramos
Keyword(s):  
Functional Data ◽  
Expert Knowledge ◽  
Probability Distributions ◽  
Knowledge Elicitation ◽  
Parallel Analysis ◽  
Data Sets ◽  
Dimensional Problem ◽  
Prior Distributions ◽  
Infinite Dimensional ◽  
Finite Dimensional

Expert knowledge elicitation (EKE) aims at obtaining individual representations of experts’ beliefs and render them in the form of probability distributions or functions. In many cases the elicited distributions differ and the challenge in Bayesian inference is then to find ways to reconcile discrepant elicited prior distributions. This paper proposes the parallel analysis of clusters of prior distributions through a hierarchical method for clustering distributions and that can be readily extended to functional data. The proposed method consists of (i) transforming the infinite-dimensional problem into a finite-dimensional one, (ii) using the Hellinger distance to compute the distances between curves and thus (iii) obtaining a hierarchical clustering structure. In a simulation study the proposed method was compared to k-means and agglomerative nesting algorithms and the results showed that the proposed method outperformed those algorithms. Finally, the proposed method is illustrated through an EKE experiment and other functional data sets.

scholarly journals The Farkas lemma of Shimizu, Aiyoshi and Katayama

1985 ◽  
Vol 31 (3) ◽  
pp. 445-450 ◽  
Author(s):  
Charles Swartz
Keyword(s):  
Convex Programming ◽  
Infinite Dimensional ◽  
Farkas Lemma ◽  
Finite Dimensional

Shimizu, Aiyoshi and Katayama have recently given a finite dimensional generalization of the classical Farkas Lemma. In this note we show that a result of Pshenichnyi on convex programming can be used to give a generalization of the result of Shimizu, Aiyoshi and Katayama to infinite dimensional spaces. A generalized Farkas Lemma of Glover is also obtained.

DUAL FORMULATION OF OPTIMAL PROBLEM FOR CONTINUOUS-TIME SYSTEMS

2005 ◽  
Vol 02 (03) ◽  
pp. 251-258
Author(s):  
HANLIN HE ◽  
QIAN WANG ◽  
XIAOXIN LIAO
Keyword(s):  
Objective Function ◽  
Continuous Time ◽  
Dimensional Space ◽  
Finite Dimensional Space ◽  
Error Response ◽  
Infinite Dimensional ◽  
Dual Formulation ◽  
Finite Dimensional ◽  
Continuous Time Systems ◽  
Time Systems

The dual formulation of the maximal-minimal problem for an objective function of the error response to a fixed input in the continuous-time systems is given by a result of Fenchel dual. This formulation probably changes the original problem in the infinite dimensional space into the maximal problem with some restrained conditions in the finite dimensional space, which can be researched by finite dimensional space theory. When the objective function is given by the norm of the error response, the maximum of the error response or minimum of the error response, the dual formulation for the problems of L1-optimal control, the minimum of maximal error response, and the minimal overshoot etc. can be obtained, which gives a method for studying these problems.

scholarly journals Free non-associative principal train algebras

1984 ◽  
Vol 27 (3) ◽  
pp. 313-319 ◽  
Author(s):  
P. Holgate
Keyword(s):  
Finite Number ◽  
Ground Field ◽  
Linear Forms ◽  
Infinite Dimensional ◽  
Finite Dimensional ◽  
The Senses ◽  
Special Train ◽  
Complex Coefficients ◽  
Infinite Linear

The definitions of finite dimensional baric, train, and special train algebras, and of genetic algebras in the senses of Schafer and Gonshor (which coincide when the ground field is algebraically closed, and which I call special triangular) are given in Worz-Busekros's monograph [8]. In [6] I introduced applications requiring infinite dimensional generalisations. The elements of these algebras were infinite linear forms in basis elements a0, a1,… and complex coefficients such that In this paper I consider only algebras whose elements are forms which only a finite number of the xi are non zero.

Sign in / Sign up

Export Citation Format

Share Document