Related papers: A parallel Buchberger algorithm for multigraded id…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
Gr\"obner bases are an important tool in computational algebra and, especially in cryptography, often serve as a boilerplate for solving systems of polynomial equations. Research regarding (efficient) algorithms for computing Gr\"obner…
In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function, assuming that the minimizer ideal is zero-dimensional. Our method is a…
For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…
We report on an approach to integration-by-parts reduction based on Gr\"obner bases. We establish the underlying noncommutative rational double-shift algebra wherein the integration-by-parts relations form a left ideal. We describe in…
This paper introduces a strategy for signature-based algorithms to compute Groebner basis. The signature-based algorithms generate S-pairs instead of S-polynomials, and use s-reduction instead of the usual reduction used in the Buchberger…
We propose a method to unify various stability results about symmetric ideals in polynomial rings by stratifying related derived categories. We execute this idea for chains of $GL_n$-equivariant modules over an infinite field $k$ of…
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
Let $K\ < x_i\ >$ be the free associative algebra generated by a finite or countable number of variables $x_i$. The notion of "letterplace correspondence" introduced in [1,2] for the graded (two-sided) ideals of $K\ < x_i\ >$ is extended in…
We present here a new approach for computing Gr\"obner bases for bilateral modules over an effective ring. Our method is based on Weispfenning notion of restricted Gr\"obner bases and related multiplication.
A persistence module $M$, with coefficients in a field $\mathbb{F}$, is a finite-dimensional linear representation of an equioriented quiver of type $A_n$ or, equivalently, a graded module over the ring of polynomials $\mathbb{F}[x]$. It is…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under…
We present a parallel computing strategy for a hybridizable discontinuous Galerkin (HDG) nested geometric multigrid (GMG) solver. Parallel GMG solvers require a combination of coarse-grain and fine-grain parallelism to improve time to…
This is the continuation of Montes' paper "On the canonical discussion of polynomial systems with parameters". In this paper we define the Minimal Canonical Comprehensive Groebner System (MCCGS) of a parametric ideal and fix under which…
A contemporary and exciting application of Groebner bases is their use in computational biology, particularly in the reverse engineering of gene regulatory networks from experimental data. In this setting, the data are typically limited to…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…