Related papers: Algorithm for structure constants
One of the common obstacles for learning causal models from data is that high-order conditional independence (CI) relationships between random variables are difficult to estimate. Since CI tests with conditioning sets of low order can be…
We consider the problem of extracting a low-dimensional, linear latent variable structure from high-dimensional random variables. Specifically, we show that under mild conditions and when this structure manifests itself as a linear space…
We show how the minimal free resolution of a set of $n$ points in general position in projective space of dimension $n-2$ explicitly determines structure constants for a ring of rank $n$. This generalises previously known constructions of…
Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an…
A new class of infinite dimensional simple Lie algebras over a field with characteristic 0 are constructed. These are examples of non-graded Lie algebras. The isomorphism classes of these Lie algebras are determined. The structure space of…
We present a new algorithm for constructing a Chevalley basis for any Chevalley Lie algebra over a finite field. This is a necessary component for some constructive recognition algorithms of exceptional quasisimple groups of Lie type. When…
Constructions of n-Lie algebras by strong n-Lie-Poisson algebras are given. First cohomology groups of adjoint module of Jacobian algebras are calculated. Minimal identities of 3-Jacobian algebra are found.
Methods of construction of the composition function, left- and right-invariant vector fields and differential 1-forms of a Lie group from the structure constants of the associated Lie algebra are proposed. It is shown that in the second…
We study the classical Election problem in anonymous net- works, where solutions can rely on the use of random bits, which may be either shared or unshared among nodes. We provide a complete char- acterization of the conditions under which…
We investigate the real Lie algebra of first-order differential operators with polynomial coefficients, which is subject to the following requirements. (1) The Lie algebra should admit a basis of differential operators with homogeneous…
In this work, we introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra associated with the hermitian generator(s) of the individual layers.…
Two constructions of the Darboux-Halphen system are discussed. In the Jacobi construction we start with multi-valued functions which are fixed as the first integrals. In the Lie construction we use single-valued representation of the simple…
The notion of the characteristic Lie algebra of the discrete hyperbolic type equation is introduced. An effective algorithm to compute the algebra for the equation given is suggested. Examples and further applications are discussed.
We study the richness of the ensemble of graphical structures (i.e., unlabeled graphs) of the one-dimensional random geometric graph model defined by $n$ nodes randomly scattered in $[0,1]$ that connect if they are within the connection…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
We give an algorithm for constructing the algebraic hull of a given matrix Lie algebra in characteristic zero. It is based on an algorithm for finding integral linear dependencies of the roots of a polynomial, that is probably of…
In this note, we use give some algebraic applications of a previous result by the author which compares the deformations parameterized by the Maurer-Cartan elements of a differential graded Lie algebra, and a differential graded Lie…
The Jacobi ensemble is one of the classical ensembles of random matrix theory. Prominent in applications are properties of the eigenvalues at the spectrum edge, specifically the distribution of the largest (e.g. Roy's largest root test in…
A fast algorithm to study one-dimensional self-gravitating systems, and, more generally, systems that are Lagrangian integrable between collisions, is presented. The algorithm is event-driven, and uses a heap-ordered set of predicted future…
In this work, we construct a stable and fairly fast estimator for solving non-parametric multidimensional regression problems. The proposed estimator is based on the use of multivariate Jacobi polynomials that generate a basis for a reduced…