Related papers: Algorithm for structure constants
In this research we obtain the classical r-matrices of real two and three dimensional Jacobi-Lie bialgebras. In this way, we classify all non-isomorphic real two and three dimensional coboundary Jacobi-Lie bialgebras and their types…
We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probability, structure independent. We show, using block size…
Libor \v{S}nobl and Pavel Winternitz classified all of the Lie algebras of dimension six and smaller. Using this classification, we formulated and proved structure constant formulas for the universal enveloping algebras of the nilpotent Lie…
An algorithm is described to compute the canonical basis of an irreducible module over a quantized enveloping algebra of a finite-dimensional semisimple Lie algebra. The algorithm works for modules that are constructed as a submodule of a…
We describe algorithms for computing the induced nilpotent orbits in semisimple Lie algebras. We use them to obtain the induction tables for the Lie algebras of exceptional type. This also yields the classification of the rigid nilpotent…
We formulate and prove a Jakobson-Benedicks-Carleson type theorem on the occurence of nonuniform hyperbolicity (stochastic dynamics) in families of one-dimensional maps, based on "computable starting conditions" and providing "explicit,…
We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of closed semialgebraic sets given by Boolean formulas without negations over lax polynomial inequalities. The algorithm works in weak…
Approximating ground and a fixed number of excited state energies, or equivalently low order Hamiltonian eigenvalues, is an important but computationally hard problem. Typically, the cost of classical deterministic algorithms grows…
We propose and study a hierarchical algorithm to generate graphs having a predetermined distribution of cliques, the fully connected subgraphs. The construction mechanism may be either random or incorporate preferential attachment. We…
According to Kirillov's theory, the construction of a unitary irreducible representation of a nilpotent Lie group requires a precise computation of some polarizing subalgebra subordinated to a linear functional in the linear dual of the…
In this paper, via the least squares variational method, we develop the Lagrange geometry (in the sense of nonlinear connection, d-torsions and the deviation curvature tensor) and the KCC theory for a given dynamical system. Further, a…
This report presents an algorithm for determining the unknown rates in the sequential processes of a Stochastic Process Algebra model, provided that the rates in the combined flat model are given. Such a rate lifting is useful for model…
We have rediscovered a simple algorithm to compute the mathematical constant \[ \pi=3.14159265\cdots. \] The algorithm had been known for a long time but it might not be recognized as a fast, practical algorithm. The time complexity of it…
We present in this paper a set of routines constructed to compute the rank of a matrix Lie algebra and also to determine a Cartan subalgebra from a given list of elements
The problem of the construction of Lagrangian and Hamiltonian structures starting from two first order equations of motion is presented. This new approach requires the knowledge of one (time independent) constant of motion for the dynamical…
When $k$ is a field, the classical Jacobian criterion computes the singular locus of an equidimensional, finitely generated $k$-algebra as the closed subset of an ideal generated by appropriate minors of the so-called Jacobian matrix.…
We assume the permutation $\pi$ is given by an $n$-element array in which the $i$-th element denotes the value $\pi(i)$. Constructing its inverse in-place (i.e. using $O(\log{n})$ bits of additional memory) can be achieved in linear time…
Consider a class of decomposable combinatorial structures, using different types of atoms $\Atoms = \{\At_1,\ldots ,\At_{|{\Atoms}|}\}$. We address the random generation of such structures with respect to a size $n$ and a targeted…
Many algorithms are specified with respect to a fixed but unspecified parameter. Examples of this are especially common in cryptography, where protocols often feature a security parameter such as the bit length of a secret key. Our aim is…
The long-term dynamics of many dynamical systems evolve on an attracting, invariant "slow manifold" that can be parameterized by a few observable variables. Yet a simulation using the full model of the problem requires initial values for…