Related papers: Groebner bases over fields with valuations
Prime-based ordering which is proved to be admissible, is the encoding of indeterminates in power-products with prime numbers and ordering them by using the natural number order. Using Eiffel, four versions of Buchberger's improved…
In this work, we extend modular techniques for computing Gr\"obner bases involving rational coefficients to (two-sided) ideals in free algebras. We show that the infinite nature of Gr\"obner bases in this setting renders the classical…
A set of polynomials G in a polynomial ring S over a field is said to be a universal Groebner basis, if G is a Groebner basis with respect to every term order on S. Twenty years ago Bernstein, Sturmfels, and Zelevinsky proved that the set…
We prove the triviality of the Grothendieck ring of a integer-valued field K under slight conditions on the logical language and on K. We construct a definable bijection from the plane K^2 to itself minus a point. When we specialize to…
We study the complexity of Gr\"obner bases computation, in particular in the generic situation where the variables are in simultaneous Noether position with respect to the system. We give a bound on the number of polynomials of degree $d$…
Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse…
Signature-based algorithms have become a standard approach for computing Gr\"obner bases in commutative polynomial rings. However, so far, it was not clear how to extend this concept to the setting of noncommutative polynomials in the free…
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…
We prove a sharp lower bound on the number of terms in an element of the reduced Gr\"obner basis of a Schubert determinantal ideal $I_w$ under the term order of [Knutson-Miller '05]. We give three applications. First, we give a…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We develop a Gr\"obner basis theory for a class of algebras that generalizes both PBW-algebras and rings of differential algebras on smooth varieties. Emphasis lies on methods to compute filtrations and graded structures defined by weight…
Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…
In this paper we present a right version of the algorithms developed for to compute Gr\"obner bases over bijective skew PBW extensions in the left case given in [3]. In particular, we adapt the theory of reduction and we build a right…
We give explicit generators for ideals of two classes of subspace arrangements embedded in certain reflection arrangements, generalizing results of Li-Li and Kleitman-Lovasz. We also give minimal generators for the ideals of arrangements…
We apply the theory of Groebner bases to the computation of free resolutions over a polynomial ring, the defining equations of a canonically embedded curve, and the unirationality of the moduli space of curves of a fixed genus.
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…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
We develop a method for approximating the Gr\"obner basis of the ideal of polynomials which vanish at a finite set of points, when the coordinates of the points are known with only limited precision. The method consists of a preprocessing…
We show that in the constant coefficient case the generic tropical variety of a graded ideal exists. This can be seen as the analogon to the existence of the generic initial ideal in Groebner basis theory. We determine the generic tropical…
We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…