Related papers: Algorithms in Linear Algebraic Groups

One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…

An explicit algorithm is given for the computation of the Hausdorff dimension of the closure of a regular branch group in terms of an arbitrary branch structure. We implement this algorithm in GAP and apply it to a family of GGS-groups…

We propose a simple doubly stochastic block Gauss--Seidel algorithm for solving linear systems of equations. By varying the row partition parameter and the column partition parameter of the coefficient matrix, we recover the Landweber…

This paper describes an approach to computer aided calculations in the cohomology of arithmetic groups. It complements existing literature on the topic by emphasizing homotopies and perturbation techniques, rather than cellular subdivision,…

The lower and upper bound of any given algorithm is one of the most crucial pieces of information needed when evaluating the computational effectiveness for said algorithm. Here a novel method of Boolean Algebraic Programming for symbolic…

We provide an algorithm to compute the 2-norm maximum of a multilinear map over a product of spheres. As a corollary we give a method to compute the first singular value of a linear map and an application to the theory of entangled states…

We consider the disjoint bilinear programming problem in which one of the disjoint subsets has the structure of an acute-angled polytope. An optimality criterion for such a problem is formulated and proved, and based on this, a polynomial…

Semidefinite programs (SDP) are one of the most versatile frameworks in numerical optimization, serving as generalizations of many conic programs and as relaxations of NP-hard combinatorial problems. Their main drawback is their…

This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…

We present here algorithms for efficient computation of linear algebra problems over finite fields.

Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…

In this paper we propose a (non-linear) smoothing algorithm for group-affine observation systems, a recently introduced class of estimation problems on Lie groups that bear a particular structure. As most non-linear smoothing methods, the…

Building on the classification of modules for algebraic groups with finitely many orbits on subspaces, we determine all faithful irreducible modules for simple and maximal-semisimple connected algebraic groups that are orthogonal and have…

Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…

We formulate generalizations of Pauli's theorem on the cases of real and complex Clifford algebras of even and odd dimensions. We give analogues of these theorems in matrix formalism. Using these theorems we present an algorithm for…

We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…

The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…

We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…

Lie-theoretic structures of type $E_8$ (e.g., Lie groups and algebras, Hecke algebras and Kazhdan-Lusztig cells, ...) are considered to serve as a `gold standard' when it comes to judging the effectiveness of a general algorithm for solving…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…