Related papers: Algorithm for structure constants
Given a list of $N$ states with probabilities $0<p_1\leq\cdots\leq p_N$, the average conditional algorithmic information $\bar I$ to specify one of these states obeys the inequality $H\leq\bar I<H+O(1)$, where $H=-\sum p_j\log_2p_j$ and…
Many iterative algorithms in optimization, computational geometry, computer algebra, and other areas of computer science require repeated computation of some algebraic expression whose input changes slightly from one iteration to the next.…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize…
The paper is devoted to classification problem of finite dimensional complex none Lie filiform Leibniz algebras. Actually, the observations show there are two resources to get classification of filiform Leibniz algebras. The first of them…
We consider a class of real numbers, a subset of irrational numbers and certain mathematical constants, for which the elements in the simple continued fraction appears to be random. As an illustrative example, one can consider $\pi = \{x_0,…
The aim of this paper is to investigate the response of this system/scheme in terms of stability in presence of explicitly treated residual terms, as it inevitably occurs in the reality of NWP. This sudy is restricted to the impact of…
The expected value of some complex valued random vectors is computed by means of the indicator function of a designed experiment as known in algebraic statistics. The general theory is set-up and results are obtained for finite discrete…
In this paper we build a set of parametric quotient Lie group structures on the probabilistic simplex that can be extended to real vector space structures. In particular, we rediscover the main mathematical objects generally used when…
We study the existence problem for Novikov algebra structures on finite-dimensional Lie algebras. We show that a Lie algebra admitting a Novikov algebra is necessarily solvable. Conversely we present a $2$-step solvable Lie algebra without…
We study finite $l$-colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures (with a given underlying pregeometry) by which colours are first randomly…
Dynamic Bayesian networks provide a compact and natural representation for complex dynamic systems. However, in many cases, there is no expert available from whom a model can be elicited. Learning provides an alternative approach for…
This article explains how to apply the computer algebra package GAP (www.gap-system.org) in the computation of the problems in quantum physics, in which the application of Lie algebra is necessary. The article contains several exemplary…
The structural constants of an evolution algebra is given by a quadratic matrix $A$. In this work we establish equivalence between nil, right nilpotent evolution algebras and evolution algebras, which are defined by upper triangular matrix…
A Lax operator algebra is constructed for an arbitrary semi-simple Lie algebra over $\mathbb C$ equipped with a $\mathbb Z$-grading, and arbitrary compact Riemann surface with marked points. In this set-up, a treatment of almost graded…
Subspace codes have important applications in random network coding. It is interesting to construct subspace codes with both sizes, and the minimum distances are as large as possible. In particular, cyclic constant dimension subspaces codes…
In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…
This is a short presentation of some classical results on finite dimensional complex Lie algebras (classification of nilpotent Lie algebras, deformations and perturbations, contractions and rigidity). We present some applications to…
The Johnson-Lindenstrauss lemma is a fundamental result in probability with several applications in the design and analysis of algorithms in high dimensional geometry. Most known constructions of linear embeddings that satisfy the…
We illustrate an algorithm to classify nice nilpotent Lie algebras of dimension $n$ up to a suitable notion of equivalence; applying the algorithm, we obtain complete listings for $n\leq9$. On every nilpotent Lie algebra of dimension $\leq…