Related papers: Efficient computations in central simple algebras …
We consider the problem of finding the isolated common roots of a set of polynomial functions defining a zero-dimensional ideal I in a ring R of polynomials over C. We propose a general algebraic framework to find the solutions and to…
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central problem solved by Shor's factoring algorithm. We suggest an…
We characterize characteristic polynomials of elements in a central simple algebra. We also give an account for the theory of rational canonical forms for separable linear transformations over a central division algebra, and a description…
In characteristic two, it is shown that a central simple algebra of degree equal to a power of two with anisotropic orthogonal involution is totally decomposable, if it becomes either anisotropic or metabolic over all extensions of the…
We develop algebraic methods for computations with tensor data. We give 3 applications: extracting features that are invariant under the orthogonal symmetries in each of the modes, approximation of the tensor spectral norm, and…
The gauge invariant degrees of freedom of matrix models based on an N x N complex matrix, with U(N) gauge symmetry, contain hidden free particle structures. These are exhibited using triangular matrix variables via the Schur decomposition.…
We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…
Cohomology operations (including the cohomology ring) of a geometric object are finer algebraic invariants than the homology of it. In the literature, there exist various algorithms for computing the homology groups of simplicial complexes…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
We present an effective algorithm for computing the standard cohomology spaces of finitely generated Lie (super) algebras over a commutative field K of characteristic zero. In order to reach explicit representatives of some generators of…
Factoring large integers using a quantum computer is an outstanding research problem that can illustrate true quantum advantage over classical computers. Exponential time order is required in order to find the prime factors of an integer by…
Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…
We initiate the representation theory of the degenerate affine periplectic Brauer algebra on $n$ strands by constructing its finite-dimensional calibrated representations when $n=2$. We show that any such representation that is…
Combinatorial optimization - a field of research addressing problems that feature strongly in a wealth of scientific and industrial contexts - has been identified as one of the core potential fields of applicability of quantum computers. It…
In this paper we show that if two central simple $k$-algebras generate the same cyclic subgroup in $\mathrm{Br}(k)$, then there are rational maps between varieties associated to these algebras, such as Brauer--Severi varieties, norm…
A valuation theoretic approach is presented that directly leads to division algebras that are noncrossed products (instead of, e.g., describing Brauer classes of noncrossed products in an abstract manner). While this feature is shared by…
Constructing complex computation from simpler building blocks is a defining problem of computer science. In algebraic automata theory, we represent computing devices as semigroups. Accordingly, we use mathematical tools like products and…
We provide a survey of past research and a list of open problems regarding central simple algebras and the Brauer group over a field, intended both for experts and for beginners.
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
We address the question of computing one selected term of an algebraic power series. In characteristic zero, the best algorithm currently known for computing the $N$th coefficient of an algebraic series uses differential equations and has…