Related papers: Quantifier Elimination over Finite Fields Using Gr…
It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…
Over the past decade, the Gr\"obner basis theory and automatic solver generation have lead to a large number of solutions to geometric vision problems. In practically all cases, the derived solvers apply a fixed elimination template to…
Quantifier elimination theorems show that each formula in a certain theory is equivalent to a formula of a specific form -- usually a quantifier-free one, sometimes in an extended language. Model theoretic embedding tests are a frequently…
We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…
The solution and implementation of the inverse kinematics computation of a three degree-of-freedom (DOF) robot manipulator using an algorithm for real quantifier elimination with Comprehensive Gr\"obner Systems (CGS) are presented. The…
We study the representation theory of quantizations of Gieseker moduli spaces. We describe the categories of finite dimensional representations for all parameters and categories O for special values of parameters. We find the values of…
Signature-based algorithms have become a standard approach for Gr\"obner basis computations for polynomial systems over fields, but how to extend these techniques to coefficients in general rings is not yet as well understood. In this…
It was proved by Sela and by the authors that every formula in the theory of a free group $F$ is equivalent to a boolean combination of $\exists\forall$-formulas. We also proved that the elementary theory of a free group is decidable (there…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…
By using methods of umbral nature, we discuss new rules concerning the operator ordering. We apply the technique of formal power series to take advantage from the wealth of properties of the exponential operators. The usefulness of the…
In the present paper we develop a small cancellation theory for associative algebras with a basis of invertible elements. Namely, we study quotients of a group algebra of a free group and introduce three axioms for the corresponding…
We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…
We present different techniques for applying Combinatorial Nullstellensatz to polynomials over finite fields. For examples, we generalize theorems from Noga Alon's paper on the subject, and present a few of our own.
We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…
Running verification tasks in database driven systems requires solving quantifier elimination problems of a new kind. These quantifier elimination problems are related to the notion of a cover introduced in ESOP 2008 by Gulwani and…
It is known that for binary codes one can use Gr\"obner bases to obtain a subset of codewords of minimal support that can be used to determine the second generalized Hamming weight of the code. In this paper we establish conditions on a…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
Two models were recently proposed to explore the robust hardness of Gr\"obner basis computation. Given a polynomial system, both models allow an algorithm to selectively ignore some of the polynomials: the algorithm is only responsible for…
Many systems of interest in cryptography consist of equations of the same degree. Under the assumption that the degree of regularity is finite, we prove upper bounds on the degree of regularity of a system of equations of the same degree,…