Related papers: Quantifier Elimination over Finite Fields Using Gr…
This is the first in a series of papers on an attempt to understand quantum field theory mathematically. In this paper we shall introduce and study BV QFT algebra and BV QFT as the proto-algebraic model of quantum field theory by exploiting…
The dynamic algorithm to compute a Gr\"obner basis is nearly twenty years old, yet it seems to have arrived stillborn; aside from two initial publications, there have been no published followups. One reason for this may be that, at first…
We review Grover's algorithm by means of a detailed geometrical interpretation and a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are also reviewed. This work is intended for non-specialists which have…
Since Buchberger's initial algorithm for computing Gr\"obner bases in 1965 many attempts have been taken to detect zero reductions in advance. Buchberger's Product and Chain criteria may be known the most, especially in the installaton of…
The only known constructive factorization algorithm for linear partial differential operators (LPDOs) is Beals-Kartashova (BK) factorization \cite{bk2005}. One of the most interesting features of BK-factorization: at the beginning all the…
Based on a theorem by Vasconcelos, we give an algorithm for equidimensional decomposition of algebraic sets using syzygy computations via Gr\"obner bases. This algorithm avoids the use of elimination, homological algebra and processing the…
The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.
One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…
Adjoining to the language of rings the function symbols for splitting coefficients, the function symbols for relative $p$-coordinate functions, and the division predicate for a valuation, some theories of pseudo-algebraically closed…
A strong link between information geometry and algebraic statistics is made by investigating statistical manifolds which are algebraic varieties. In particular it it shown how first and second order efficient estimators can be constructed,…
We classify all cubic function fields over any finite field, particularly developing a complete Galois theory which includes those cases when the constant field is missing certain roots of unity. In doing so, we find criteria which allow…
We give algebraic conditions about a finite algebra $B$ over a perfect field of positive characteristic, which are equivalent to the companionability of the theory of fields with "$B$-operators" (i.e. the operators coming from homomorphisms…
Quantum computation of the energy of molecules and materials is one of the most promising applications of fault-tolerant quantum computers. Practical applications require development of quantum algorithms with reduced resource requirements.…
Using polynomial equations to model combinatorial problems has been a popular tool both in computational combinatorics as well as an approach to proving new theorems. In this paper, we look at several combinatorics problems modeled by…
Let $L$ be the language of rings. We provide an axiomatization of the $L$-theories of quaternions and octonions and characterize their models: they coincide, up to isomorphism, with quaternion and octonion algebras over a real closed field,…
In this paper we describe a parallel Gaussian elimination algorithm for matrices with entries in a finite field. Unlike previous approaches, our algorithm subdivides a very large input matrix into smaller submatrices by subdividing both…
We present an algorithm for computing Groebner bases of vanishing ideals of points that is optimized for the case when the number of points in the associated variety is less than the number of indeterminates. The algorithm first identifies…
We introduce the method of topological quantization for gravitational fields in a systematic manner. First we show that any vacuum solution of Einstein's equations can be represented in a principal fiber bundle with a connection that takes…
In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…
This paper is concerned with linear algebra based methods for solving exactly polynomial systems through so-called Gr\"obner bases, which allow one to compute modulo the polynomial ideal generated by the input equations. This is a topical…