Related papers: On Gr\"obner bases over Dedekind domains
We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…
We present Buchberger Theory and Algorithm of Gr\"obner bases for multivariate Ore extensions of rings presented as modules over a principal ideal domain. The algorithms are based on M\"oller Lifting Theorem.
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…
In this work, it is proposed a method for computing Noncommutative Gr\"obner bases over a valuation n{\oe}therian ring. We have generalized the fundamental theorem on normal forms over an arbitrary ring. The classical method of dynamical…
Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…
In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…
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…
We present a generalization of a polynomial factorization algorithm that works with ideals in maximal orders of global function fields. The method presented in this paper is intrinsic in the sense that it does not depend on the embedding of…
In [4] Sturmfels linked the Hilbert Nullstellensatz to Gr\"obner bases through final polynomials. In (loc. cit.) it was claimed that final polynomials always appear in a lexicographic Gr\"obner basis of a certain ideal. In this paper, we…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.
Signature-based algorithms have brought large improvements in the performances of Gr\"obner bases algorithms for polynomial systems over fields. Furthermore, they yield additional data which can be used, for example, to compute the module…
In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…
We introduce the concept of a Gr\"obner nice pair of ideals in a polynomial ring and we present some applications.
The set of common roots of a finite set $I$ (it is an ideal) of homogeneous polynomials is known as projective algebraic set $V$. In this article I show how to dualize such projective algebraic sets $V$ by elimination of variables from a…
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…
We study an inductive method of computing initial ideals and Gr\"obner bases for families of ideals in a polynomial ring. This method starts from a given set of pairs $(I,J)$ where $I$ is any ideal and $J$ is a monomial ideal contained in…
Signature-based algorithms are the latest and most efficient approach as of today to compute Gr\"obner bases for polynomial systems over fields. Recently, possible extensions of these techniques to general rings have attracted the attention…
In this paper we present the first-ever computer formalization of the theory of Gr\"obner bases in reduction rings, which is an important theory in computational commutative algebra, in Theorema. Not only the formalization, but also the…
We show that every Dedekind domain $R$ lying between the polynomial rings $\mathbb Z[X]$ and $\mathbb Q[X]$ with the property that its residue fields of prime characteristic are finite fields is equal to a generalized ring of integer-valued…
We introduce a general constructive method to find a p-basis (and the Ulm invariants) of a finite Abelian p-group M. This algorithm is based on Groebner bases theory. We apply this method to determine the additive structure of…