Related papers: An algorithm for evaluating Gram matrices in Verma…
We present a novel class of methods to compute functions of matrices or their action on vectors that are suitable for parallel programming. Solving appropriate simple linear systems of equations in parallel (or computing the inverse of…
Matrix Graph Grammars (MGG) is a novel approach to the study of graph dynamics ([15]). In the present contribution we look at MGG as a formal grammar and as a model of computation, which is a necessary step in the more ambitious program of…
We suggest a programming realization of an algorithm for verifying a given set of algebraic relations in the form of a supercommutator multiplication table for the Verma module, which is constructed according to a generalized Cartan…
This review gives an overview on the research of algorithms for dynamical fermions used in large scale lattice QCD simulations. First a short overview on the state-of-the-art of ensemble generation at the physical point is given. Followed…
In this paper we present Affine.m - program for computations in representation theory of finite-dimensional and affine Lie algebras and describe implemented algorithms. Algorithms are based upon the properties of weights and Weyl symmetry.…
"GRAMA" is a Mathematica package for doing symbolic tensor computations and complicated algebraic manipulations in 10-dimensional (D=10) simple (N=1) supergravity. The main new ingredients of this package inside the general Mathematica…
This paper investigates the structure of Verma modules over the N=1 BMS superalgebra. We provide a detailed classification of singular vectors, establish necessary and sufficient conditions for the existence of subsingular vectors, uncover…
Inspired by the decomposition in the hybrid quantum-classical optimization algorithm we introduced in arXiv:1902.04215, we propose here a new (fully classical) approach to solving certain non-convex integer programs using Graver bases. This…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
A new notion in frame theory has been introduced recently under the name woven-weaving frames by Bemrose et. al. In the studying of frames, some operators like analysis, synthesis, Gram and frame operator play the central role. In this…
Galilean $W_3$ vertex operator algebra $\mathcal GW_3(c_L,c_M)$ is constructed as a universal enveloping vertex algebra of certain non-linear Lie conformal algebra. It is proved that this algebra is simple by using determinant formula of…
Weighted finite automata (WFA) are often used to represent probabilistic models, such as $n$-gram language models, since they are efficient for recognition tasks in time and space. The probabilistic source to be represented as a WFA,…
We give a quantum algorithm for evaluating formulas over an extended gate set, including all two- and three-bit binary gates (e.g., NAND, 3-majority). The algorithm is optimal on read-once formulas for which each gate's inputs are balanced…
In the present article, we combine some techniques in the harmonic analysis together with the geometric approach given by modules over sheaves of rings of twisted differential operators ($\mathcal{D}$-modules), and reformulate the…
We have developed a Mathematica package capable of performing gamma-matrix algebra in arbitrary (integer) dimensions. As an application we can compute Fierz transformations.
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
The assignment of weights to attacks in a classical Argumentation Framework allows to compute semantics by taking into account the different importance of each argument. We represent a Weighted Argumentation Framework by a non-binary…
Algorithms for the fast and exact computation of Wigner matrices are described and their application to a fast and massively parallel 4pi convolution code between a beam and a sky is also presented.
An algorithm for the numerical inversion of large matrices, the biconjugate gradient algorithm (BGA), is investigated in view of its use for Monte Carlo simulations of fermionic field theories. It is compared with the usual conjugate…