Related papers: A Variant of the Gr\"obner Basis Algorithm for Com…

We give an algorithm to compute inhomogeneous differential equations for definite integrals with parameters. The algorithm is based on the integration algorithm for $D$-modules by Oaku. Main tool in the algorithm is the Gr\"obner basis…

We reformulate a recently introduced interpolation-based unique decoding algorithm of algebraic geometry codes using the theory of Gr\"obner bases of modules on the coordinate ring of the base curve. With the same decoding performance, the…

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 construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they form a test set (optimality certificate) with very appealing…

Let $K$ be a field equipped with a valuation. Tropical varieties over $K$ can be defined with a theory of Gr\"obner bases taking into account the valuation of $K$. Because of the use of the valuation, this theory is promising for stable…

Let K be a field with a valuation and let S be the polynomial ring S:= K[x_1,..., x_n]. We discuss the extension of Groebner theory to ideals in S, taking the valuations of coefficients into account, and describe the Buchberger algorithm in…

We study the complexity of solving the \emph{generalized MinRank problem}, i.e. computing the set of points where the evaluation of a polynomial matrix has rank at most $r$. A natural algebraic representation of this problem gives rise to a…

We present a structure associated to the class of linear codes. The properties of that structure are similar to some structures in the linear algebra techniques into the framework of the Gr\"obner bases tools. It allows to get some insight…

In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…

In this article, the reproducing kernel Hilbert space [0, 1] is employed for solving a class of third-order periodic boundary value problem by using fitted reproducing kernel algorithm. The reproducing kernel function is built to get fast…

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 note we show how to apply the Gr\"obner--Shirshov bases (GSB) method for modules over an associative algebra to the study of vertex algebras defined by generators and relations. We compute GSBs for a series of vertex algebras and…

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 describe a simple algorithm for computing the canonical basis of any irreducible finite-dimensional $U_{q}(so_{2n+1})$ or $U_{q}(so_{2n})$-module.

We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum…

Calculating dipole moments with high-order basis sets is generally only possible for the light molecules, such as water. A simple, yet highly effective strategy of obtaining high-order dipoles with small, computationally less expensive…

We compute the reduced Gr\"{o}bner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.

For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…

In this talk I give an elementary introduction to the key algorithm used in recent applications of computational algebraic geometry to the subject of string phenomenology. I begin with a simple description of the algorithm itself and then…