Related papers: Truncated Groebner fans and lattice ideals
In this paper, we study ideals spanned by polynomials or overconvergent series in a Tate algebra. With state-of-the-art algorithms for computing Tate Gr{\"o}bner bases, even if the input is polynomials, the size of the output grows with the…
Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…
A configuration of lattice vectors is supernormal if it contains a Hilbert basis for every cone spanned by a subset. We study such configurations from various perspectives, including triangulations, integer programming and Groebner bases.…
In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).
In this work we present the formal background used to develop the methods used in earlier works to extend the truncated Wigner representation of quantum and atom optics in order to address multi-time problems. The truncated Wigner…
We increase the scope of previous work on change of basis between finite bases of polynomials by defining ascending and descending bases and introducing three techniques for defining them from known ones. The minimum degrees of polynomials…
The encoding of lattice gauge theories onto quantum computers requires a discretization of the gauge field's Hilbert space on each link, which presents errors with respect to the Kogut--Susskind limit. In the electric basis, Hilbert space…
A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…
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…
There are several efficient methods to solve linear interval polynomial systems in the context of interval computations, however, the general case of interval polynomial systems is not yet covered as well. In this paper we introduce a new…
In the field of algebraic systems biology, the number of minimal polynomial models constructed using discretized data from an underlying system is related to the number of distinct reduced Gr\"obner bases for the ideal of the data points.…
Kazhdan-Lusztig ideals, a family of generalized determinantal ideals investigated in [Woo-Yong '08], provide an explicit choice of coordinates and equations encoding a neighbourhood of a torus-fixed point of a Schubert variety on a type A…
We introduce the theory of monoidal Groebner bases, a concept which generalizes the familiar notion in a polynomial ring and allows for a description of Groebner bases of ideals that are stable under the action of a monoid. The main…
We propose an algorithm to solve the problem of matching fans in interaction net implementations of optimal reduction for the pure untyped lambda calculus without use of any additional agent types. The algorithm relies upon a specific…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
Model selection based on experimental data is an important challenge in biological data science. Particularly when collecting data is expensive or time consuming, as it is often the case with clinical trial and biomolecular experiments, the…
We consider the problem of approximating a truncated Gaussian kernel using Fourier (trigonometric) functions. The computation-intensive bilateral filter can be expressed using fast convolutions by applying such an approximation to its range…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
This note computes a Gr\"obner basis for the ideal defining a union of Schubert varieties. More precisely, it computes a Gr\"obner basis for unions of schemes given by northwest rank conditions on the space of all matrices of a fixed size.…
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…