Algorithm for structure constants

TL;DR

The paper presents a computationally efficient algorithm for determining all structure constants of an n-dimensional Lie algebra from a subset, ensuring Jacobi conditions are satisfied, suitable even for low-performance computers.

Contribution

It introduces a novel algorithm capable of calculating all structure constants of a Lie algebra from partial data, optimized for low-resource computing environments.

Findings

Algorithm successfully computes all structure constants from partial data.

Ensures Jacobi conditions are satisfied throughout the computation.

Suitable for implementation on personal computers with limited resources.

Abstract

In a $n$-dimensional Lie algebra, random numerical values are assigned by computer to $n(n-1)$ especially selected structure constants. An algorithm is then created, which calculates without ambiguity the remaining constants, obeying the Jacobi conditions. Differently from others, this algorithm is suitable even for poor personal computer. ------------- En $n$-dimensia algebro de Lie, hazardaj numeraj valoroj estas asignitaj per komputilo al $n(n-1)$ speciale elektitaj konstantoj de strukturo. Tiam algoritmo estas kreita, kalkulante senambigue la ceterajn konstantojn, obeante kondicxojn de Jacobi. Malsimile al aliaj algoritmoj, tiu cxi tauxgas ecx por malpotenca komputilo.