English
Related papers

Related papers: Criteria for Finite Difference Groebner Bases of N…

200 papers

Let $F$ be a non-negatively graded free module over a polynomial ring $\mathbb{K}[x_1,\dots,x_n]$ generated by $m$ basis elements. Let $M$ be a submodule of $F$ generated by elements in $F$ with degrees bounded by $D$ and dim $F/M$=$r$. We…

Commutative Algebra · Mathematics 2022-04-22 Yihui Liang

Border bases are a generalization of Gr\"obner bases for zero-dimensional ideals in polynomial rings. In this article, we introduce border bases for a non-commutative ring of linear differential operators, namely the rational Weyl algebra.…

Algebraic Geometry · Mathematics 2026-02-13 Carlos Rodriguez , Anna-Laura Sattelberger

We generalize the analog of Buchberger's first criterion, stated by Boulier et al., for detecting useless S-polynomials reductions in the computation of characteristic sets of differential ideals. The original version assumes linear…

Commutative Algebra · Mathematics 2022-04-07 Amir Hashemi , François Ollivier

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

Commutative Algebra · Mathematics 2007-05-23 Edward Mosteig

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).

Commutative Algebra · Mathematics 2007-05-23 Ibrahim Al-Ayyoub

In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…

Symbolic Computation · Computer Science 2013-12-31 Abhishek Dubey , Ambedkar Dukkipati

In this paper, the concepts of binomial difference ideals and toric difference varieties are defined and their properties are proved. Two canonical representations for Laurent binomial difference ideals are given using the reduced Groebner…

Algebraic Geometry · Mathematics 2015-05-20 Xiao-Shan Gao , Zhang Huang , Chun-Ming Yuan

Resultants and Gr\"obner bases are crucial tools in studying polynomial elimination theory. We investigate relations between the variety of the resultant of two polynomials and the variety of the ideal they generate. Then we focus on the…

Commutative Algebra · Mathematics 2015-11-02 Matteo Gallet , Hamid Rahkooy , Zafeirakis Zafeirakopoulos

In this paper we consider systems of partial (multidimensional) linear difference equations. Specifically, such systems arise in scientific computing under discretization of linear partial differential equations and in computational high…

Symbolic Computation · Computer Science 2007-05-23 V. P. Gerdt

Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…

Commutative Algebra · Mathematics 2016-09-15 Christian Eder , Gerhard Pfister , Adrian Popescu

Developed by Buchberger for commutative polynomial rings, Groebner Bases are frequently applied to solve algorithmic problems, such as the congruence problem for ideals. Until now, these ideas have been transmitted to different in part…

Rings and Algebras · Mathematics 2009-03-31 Birgit Reinert

Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…

Commutative Algebra · Mathematics 2020-04-17 Tommy Hofmann

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…

Computational Complexity · Computer Science 2011-05-04 Prabhanjan Ananth , Ambedkar Dukkipati

Insa and Pauer presented a basic theory of Groebner basis for differential operators with coefficients in a commutative ring in 1998, and a criterion was proposed to determine if a set of differential operators is a Groebner basis. In this…

Symbolic Computation · Computer Science 2015-05-18 Xiaodong Ma , Yao Sun , Dingkang Wang

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…

Commutative Algebra · Mathematics 2014-05-08 Natalia Dück , Karl-Heinz Zimmermann

In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…

Analysis of PDEs · Mathematics 2025-10-20 Vladimir P. Gerdt

Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…

Commutative Algebra · Mathematics 2024-09-20 Chenqi Mou , Qiuye Song

We introduce the notion of Groebner S-basis of an ideal of the free associative algebra K<X> over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Groebner S-bases of the ideal…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Roberto La Scala

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…

Symbolic Computation · Computer Science 2024-01-17 Yihe Gong , Xue Jiang

In this paper we compute Gr\"obner bases for determinantal ideals of the form $I_{1}(XY)$, where $X$ and $Y$ are both matrices whose entries are indeterminates over a field $K$. We use the Gr\"obner basis structure to determine Betti…

Commutative Algebra · Mathematics 2019-01-11 Joydip Saha , Indranath Sengupta , Gaurab Tripathi