Related papers: Algorithms in Linear Algebraic Groups
We define a superalgebra S2(N/2) as a Z2 graded algebra of dimension 2N+3, where N is a positive, odd integer. The even component is a three-dimensional abelian subalgebra, while the odd component is made up of two N-dimensional, mutually…
We develop the representation theory for reductive linear differential algebraic groups (LDAGs). In particular, we exhibit an explicit sharp upper bound for orders of derivatives in differential representations of reductive LDAGs, extending…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
We show that all spin groups of non-definite, quinary quadratic forms over a field with characteristic 0 can be represented as 2 by 2 matrices with entries in an associated quaternion algebra. Over local and global fields, we further study…
We give an algorithm for solving equations and inequations with rational constraints in virtually free groups. Our algorithm is based on Rips classification of measured band complexes. Using canonical representatives, we deduce an algorithm…
Based on the general strategy described by Borel and Serre and the Voronoi algorithm for computing unit groups of orders we present an algorithm for finding presentations of $S$-unit groups of orders. The algorithm is then used for some…
A tensor network is a diagram that specifies a way to "multiply" a collection of tensors together to produce another tensor (or matrix). Many existing algorithms for tensor problems (such as tensor decomposition and tensor PCA), although…
Recent advancements in quantum computing and quantum-inspired algorithms have sparked renewed interest in binary optimization. These hardware and software innovations promise to revolutionize solution times for complex problems. In this…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
In this paper, we focus on nonlinear infinite-norm minimization problems that have many applications, especially in computer science and operations research. We set a reliable Lagrangian dual aproach for solving this kind of problems in…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…
A class of counting problems ask for the number of regions of a central hyperplane arrangement. By duality, this is the same as counting the vertices of a zonotope. We give several efficient algorithms, based on a linear optimization…
We use graded Specht modules to calculate the graded decomposition numbers for the Iwahori-Hecke algebra of the symmetric group over a field of characteristic zero at a root of unity. The algorithm arrived at is the Lascoux-Leclerc-Thibon…
We present new parametrizations of elements of spinor and orthogonal groups of dimension 4 using Grassmann exterior algebra. Theory of spinor groups is an important tool in theoretical and mathematical physics namely in the Dirac equation…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
We formulate Lorentz group representations in which ordinary complex numbers are replaced by linear functions of real quaternions and introduce dotted and undotted quaternionic one-dimensional spinors. To extend to parity the space-time…
The class $(r,2)$-CSP, or simply Max 2-CSP, consists of constraint satisfaction problems with at most two $r$-valued variables per clause. For instances with $n$ variables and $m$ binary clauses, we present an $O(n r^{5+19m/100})$-time…