Related papers: Truncated Groebner fans and lattice ideals
The Groebner walk is an algorithm for conversion between Groebner bases for different term orders. It is based on the polyhedral geometry of the Groebner fan and involves tracking a line between cones representing the initial and target…
This paper presents algorithms for computing the Groebner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Groebner bases of the ideal. Our algorithms are based on a uniform definition of the…
We present a new algorithm for computing a truncated Markov basis of a lattice. In general, this new algorithm is faster than existing methods. We then extend this new algorithm so that it solves the linear integer feasibility problem with…
In the context of modeling biological systems, it is of interest to generate ideals of points with a unique reduced Groebner basis, and the first main goal of this paper is to identify classes of ideals in polynomial rings which share this…
We generalise the notion of Gr\"obner fan to ideals in R[[t]][x_1,...,x_n] for certain classes of coefficient rings R and give a constructive proof that the Gr\"obner fan is a rational polyhedral fan. For this we introduce the notion of…
This is the first part of a work dedicated to the study of Bernstein-Sato polynomials for several analytic functions depending on parameters. The main result of this part is a constructibility result for the analytic Gr\"obner fan of a…
We present two algorithms determining all the complete and simplicial fans admitting a fixed non-degenerate set of vectors $V$ as generators of their 1-skeleton. The interplay of the two algorithms allows us to discerning if the associated…
We consider the notions of Groebner fan and Newton non-degeneracy for an ideal on a toric variety, extending the two existing notions for ideals on affine spaces. We prove, without assumptions on the characteristic of the base fields, that…
Computing Gr\"obner bases is known to have a very high upper bound on computation time with respect to input length. Due to the connection between polyhedral geometry and Gr\"obner bases through the Gr\"obner fan, one can attempt an…
The Groebner fan of an ideal $I\subset k[x_1,...,x_n]$, defined by Mora and Robbiano, is a complex of polyhedral cones in $R^n$. The maximal cones of the fan are in bijection with the distinct monomial initial ideals of $I$ as the term…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
Given an affine algebra $R=K[x_1,\dots,x_n]/I$ over a field $K$, where $I$ is an ideal in the polynomial ring $P=K[x_1,\dots,x_n]$, we examine the task of effectively calculating re-embeddings of $I$, i.e., of presentations $R=P'/I'$ such…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
The goal of this paper is to show that the local Gr\"obner fan is a polyhedral fan for ideals in the ring of power series and the homogenized ring of analytic differential operators. We will also discuss about relations between the local…
In this paper, the tropical differential Gr\"obner basis is studied, which is a natural generalization of the tropical Gr\"obner basis to the recently introduced tropical differential algebra. Like the differential Gr\"obner basis, the…
Given a finite set of arbitrarily distributed points in affine space with arbitrary multiplicity structures, we present an algorithm to compute the reduced Groebner basis of the vanishing ideal under the lexicographic ordering. Our method…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…
We study the relationship between certain Groebner bases for zero dimensional ideals, and the interpolation condition functionals of ideal interpolation. Ideal interpolation is defined by a linear idempotent projector whose kernel is a…
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…