Related papers: Algorithms in Linear Algebraic Groups
The discrete logarithm problem in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have time complexity of $\mathcal{O}(\sqrt{N}\log N)$, and a space complexity of…
We describe a recursive algorithm that decomposes an algebraic set into locally closed equidimensional sets, i.e. sets which each have irreducible components of the same dimension. At the core of this algorithm, we combine ideas from the…
We present a method of computing elements of spin groups in the case of arbitrary dimension. This method generalizes Hestenes method for the case of dimension 4. We use the method of averaging in Clifford's geometric algebra previously…
An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain…
A real representation $\pi$ of a finite group may be regarded as a homomorphism to an orthogonal group $\Or(V)$. For symmetric groups $S_n$, alternating groups $A_n$, and products $S_n \times S_{n'}$ of symmetric groups, we give criteria…
Motivated by a certain molecular reconstruction methodology in cryo-electron microscopy, we consider the problem of solving a linear system with two unknown orthogonal matrices, which is a generalization of the well-known orthogonal…
The main motivation of our work is to create an efficient algorithm that decides hypertranscendence of solutions of linear differential equations, via the parameterized differential and Galois theories. To achieve this, we expand the…
The rank of a finite algebraic structure with a single binary operation is the minimum number of elements needed to express every other element under the closure of the operation. In the case of groups, the previous best algorithm for…
We consider the problem of finding exact sums of squares (SOS) decompositions for certain classes of non-negative multivariate polynomials, relying on semidefinite programming (SDP) solvers. We start by providing a hybrid numeric-symbolic…
In numerical linear algebra, considerable effort has been devoted to obtaining faster algorithms for linear systems whose underlying matrices exhibit structural properties. A prominent success story is the method of generalized nested…
An iterative decoding algorithm for convolutional codes is presented. It successively processes $N$ consecutive blocks of the received word in order to decode the first block. A bound is presented showing which error configurations can be…
The computation of a maximal order of an order in a semisimple algebra over a global field is a classical well-studied problem in algorithmic number theory. In this paper we consider the related problems of computing all minimal overorders…
We find an algorithmic procedure that enables to compute and to describe the structure of the isotropy subgroups of the group of complex orthogonal matrices with respect to the action of similarity on complex symmetric matrices. A key step…
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset. We use fully connected neural networks to model the symmetry transformations and the corresponding…
We consider solutions of the 2x2 matrix Hamiltonians of the physical systems within the context of the su(2) and su(1,1) Lie algebra. Our technique is relatively simple when compared with the others and treats those Hamiltonians which can…
We present an algorithm which given a presentation of a group $G$ without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant ${\kappa}$, outputs a collection of tracks in an…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
The results of computational experiments with ABS algorithms for overdetermined linear systems are reported.
We describe a Lohner-type algorithm for the computation of rigorous upper bounds for reachable set for control systems, solutions of ordinary differential inclusions and perturbations of ODEs.
Benson's outer approximation algorithm and its variants are the most frequently used methods for solving linear multiobjective optimization problems. These algorithms have two intertwined components: one-dimensional linear optimization one…