Related papers: A non-commutative F5 algorithm with an application…
We implement two algorithms in MATHEMATICA for classifying automorphisms of lower-dimensional non-commutative Lie algebras. The first algorithm is a brute-force approach whereas the second is an evolutionary strategy. These algorithms are…
It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…
Slicing a module into semisimple ones is useful to study modules. Loewy structures provide a means of doing so. To establish the Loewy structures of projective modules over a finite dimensional symmetric algebra over a field $F$, the…
We present results for the corrections of order alpha^2 (Z alpha)^5 to the Lamb shift. We compute all the contributing Feynman diagrams in dimensional regularization and a general covariant gauge using a mixture of analytical and numerical…
In this paper we propose a general method for computing a minimal free right resolution of a finitely presented graded right module over a finitely presented graded noncommutative algebra. In particular, if such module is the base field of…
We provide an algorithmic method for constructing projective resolutions of modules over quotients of path algebras. This algorithm is modified to construct minimal projective resolutions of linear modules over Koszul algebras.
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
A novel class of derivative-free optimization algorithms is developed. The main idea is to utilize certain non-commutative maps in order to approximate the gradient of the objective function. Convergence properties of the novel algorithms…
We consider classical and quantum mechanics related to an additional noncommutativity, symmetric in position and momentum coordinates. We show that such mechanical system can be transformed to the corresponding one which allows employment…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
We formulate a mathematical setup for computational neural networks using noncommutative algebras and near-rings, in motivation of quantum automata. We study the moduli space of the corresponding framed quiver representations, and find…
We consider Feynman's path integral approach to quantum mechanics with a noncommutativity in position and momentum sectors of the phase space. We show that a quantum-mechanical system with this kind of noncommutativity is equivalent to the…
Inspired by the commutator and anticommutator algebras derived from algebras graded by groups, we introduce noncommutatively graded algebras. We generalize various classical graded results to the noncommutatively graded situation concerning…
Faugere's F5 algorithm computes a Groebner basis incrementally, by computing a sequence of (non-reduced) Groebner bases. The authors describe a variant of F5, called F5C, that replaces each intermediate Groebner basis with its reduced…
A Gr\"obner basis computation for the Weyl algebra with respect to a tropical term order and by using a homogenization-dehomogenization technique is sufficiently sluggish. A significant number of reductions to zero occur. To improve the…
In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…
We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…
A new purely algebraic algorithm is presented for computation of invariants (generalized Casimir operators) of Lie algebras. It uses the Cartan's method of moving frames and the knowledge of the group of inner automorphisms of each Lie…
The F5 algorithm is generally believed as one of the fastest algorithms for computing Gr\"{o}bner bases. However, its termination problem is still unclear. Recently, an algorithm GVW and its variant GVWHS have been proposed, and their…
We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix inversion: it efficiently inverts differential…