Related papers: Algorithm for structure constants
We construct a calculus structure on the Lie conformal algebra cochain complex. By restricting to degree one chains, we recover the structure of a g-complex introduced in [DSK]. A special case of this construction is the variational…
The problem of structure estimation in graphical models with latent variables is considered. We characterize conditions for tractable graph estimation and develop efficient methods with provable guarantees. We consider models where the…
A powerful method for solving non-linear first-order ordinary differential equations, which is based on geometrical understanding of the corresponding dynamics of the so called Lie systems, is developed. This method allows us not only to…
It is known for scalar ordinary differential equations, and for systems of ordinary differential equations of order not higher than the third, that their Lie point symmetry algebras is of maximal dimension if and only if they can be reduced…
Bayesian inverse problems use data to update a prior probability distribution on uncertain parameter values to a posterior distribution. Such problems arise in many structural engineering applications, but computational solution of Bayesian…
We construct noncomplete orthogonal systems on the ray $[0,\infty)$ that look like Jacobi polynomials $P_n(x)$ after a shift of degree $n\mapsto n+a$, where $a$ is a real constant. These systems are solutions of some exotic Sturm-Liouville…
This article is the second in the series and is devoted to the type G_2. The work consists of two parts. In the first part we calculate the structure constants of the complex simple Lie algebra of type G_2. All structure constants are…
We consider the PC-algorithm Spirtes et. al. (2000) for estimating the skeleton of a very high-dimensional acyclic directed graph (DAG) with corresponding Gaussian distribution. The PC-algorithm is computationally feasible for sparse…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
Beautiful formulas are known for the expected cost of random two-dimensional assignment problems, but in higher dimensions even the scaling is not known. In three dimensions and above, the problem has natural "Axial" and "Planar" versions,…
We study stability of the eigenvalues of the generator of a one dimensional reversible diffusion process satisfying some natural conditions. The proof is based on Stein's method. In particular, these results are applied to the Normal…
We provide a careful analysis of the structure theorem for the $n$-qudit projective Clifford group and various encoding schemes for its elements. In particular, we derive formulas for evaluation, composition, and inversion. Our results…
Unbiased random vectors i.e. distributed uniformly in n-dimensional space, are widely applied and the computational cost of generating a vector increases only linearly with n. On the other hand, generating uniformly distributed random…
We present in this paper a routine which construct the ideal generated by a list of elements in a matrix Lie algebra at any particular characteristic. We have used this algorithm to analyze the problem of the simplicity of some Lie…
The Schubert problem asks for combinatorial models to compute structure constants of the cohomology ring with respect to Schubert classes and has been an important open problem in algebraic geometry and combinatorics that guided fruitful…
We introduce the notion of Local Computation Mechanism Design - designing game theoretic mechanisms which run in polylogarithmic time and space. Local computation mechanisms reply to each query in polylogarithmic time and space, and the…
This paper concerns the problem of classifying finite-dimensional real solvable Lie algebras whose derived algebras are of codimension 1 or 2. On the one hand, we present an effective method to classify all $(n+1)$-dimensional real solvable…
Admissible structure constants related to the dual Lie superalgebras of particular Lie superalgebra $({\cal C}^3 + {\cal A})$ are found by straightforward calculations from the matrix form of super Jacobi and mixed super Jacobi identities…
We construct new algorithms from scratch, which use the fourth order cumulant of stochastic variables for the cost function. The multiplicative updating rule here constructed is natural from the homogeneous nature of the Lie group and has…
In Gaussian graphical models, the likelihood equations must typically be solved iteratively. We investigate two algorithms: A version of iterative proportional scaling which avoids inversion of large matrices, and an algorithm based on…