Related papers: Efficient computations in central simple algebras …
It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's algorithm, which counts the number of $\mathbb F_q$-points of…
Solving and visualizing the potential roots of complex functions is essential in both theoretical and applied domains, yet often computationally intensive. We present a hardware-accelerated algorithm for complex function roots density graph…
The representation of polynomials by arithmetic circuits evaluating them is an alternative data structure which allowed considerable progress in polynomial equation solving in the last fifteen years. We present a circuit based computation…
An associative central simple algebra is a form of matrices, because a maximal \'{e}tale subalgebra acts on the algebra faithfully by left and right multiplication. In an attempt to extract and isolate the full potential of this point of…
We propose a factorizability ansatz for angular bispectra which permits fast algorithms for forecasting, analysis, and simulation, yet is general enough to encompass many interesting CMB bispectra. We describe a suite of general algorithms…
We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…
The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…
We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…
Sparse polynomial approximation has become indispensable for approximating smooth, high- or infinite-dimensional functions from limited samples. This is a key task in computational science and engineering, e.g., surrogate modelling in…
We propose a new identification system based on algorithmic problems related to computing isomorphisms between central simple algebras. We design a statistical zero knowledge protocol which relies on the hardness of computing isomorphisms…
We present a framework for computing the solution to Hamiltonian eigenproblems in a subspace defined by bit-strings sampled from a quantum computer. Hamiltonians are represented using an extended alphabet that includes projection and ladder…
We generalize Amitsur's construction of central simple algebras over a field $F$ which are split by field extensions possessing a derivation with field of constants $F$ to nonassociative algebras: for every central division algebra $D$ over…
We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and…
We propose a polynomial time $f$-algorithm (a deterministic algorithm which uses an oracle for factoring univariate polynomials over $\mathbb{F}_q$) for computing an isomorphism (if there is any) of a finite dimensional…
We consider a finite group acting on a vector space and the corresponding skew group algebra generated by the group and the symmetric algebra of the space. This skew group algebra illuminates the resulting orbifold and serves as a…
We consider heuristic algorithm for solving graph isomorphism problem. The algorithm based on a successive splitting of the eigenvalues of the matrices which are modifications (to positive defined) of graphs' adjacency matrices.…
We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, log partition functions, and marginal edge probabilities in certain binary undirected graphical models. Our approach…
As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…
This paper describes an algorithm which computes the characteristic polynomial of a matrix over a field within the same asymptotic complexity, up to constant factors, as the multiplication of two square matrices. Previously, this was only…
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…