Related papers: Minimal Gr\"obner bases and the predictable leadin…

The F5 algorithm is generally believed as one of the fastest algorithms for computing Gr\"{o}bner bases. However, its termination problem is still unclear. Recently, an algorithm GVW and its variant GVWHS have been proposed, and their…

To every $h + \mathbb{N}$-graded module $M$ over an $\mathbb{N}$-graded conformal vertex algebra $V$, we associate an increasing filtration $(G^pM)_{p \in \mathbb{Z}}$ which is compatible with the filtrations introduced by Haisheng Li. The…

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 study a question which can be roughly stated as follows: Given a (unital or nonunital) algebra $A$ together with a Gr\"obner-Shirshov basis $G$, consider the free operated algebra $B$ over $A$, such that the operator satisfies some…

We use the idea of generic extensions to investigate the correspondence between the isomorphism classes of nilpotent representations of a cyclic quiver and the orbits in the corresponding representation varieties. We endow the set $\cal M$…

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…

In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…

Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of…

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…

Let R be a ring of polynomials in a finite number of variables over a perfect field k of characteristic p>0 and let F:R\to R be the Frobenius map of R, i.e. F(r)=r^p. We explicitly describe an R-module isomorphism Hom_R(F_*(M),N)\cong…

We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…

The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…

Constructive proofs of fact that a stably free left $S$-module $M$ with rank$(M)\geq$sr$(S)$ is free, where sr$(S)$ denotes the stable rank of an arbitrary ring $S$, were developed in some articles. Additionally, in such papers, are…

Minimal Markov bases of configurations of integer vectors correspond to minimal binomial generating sets of the assocciated lattice ideal. We give necessary and sufficient conditions for the elements of a minimal Markov basis to be (a)…

In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…

Nowadays, many strategies to solve polynomial systems use the computation of a Gr{\"o}bner basis for the graded reverse lexicographical ordering, followed by a change of ordering algorithm to obtain a Gr{\"o}bner basis for the…

Parametric Gr\"obner bases have been studied for more than 15 years and are now a further developed subject. Here we propose a general study of parametric standard bases, that is with local orders. We mainly focus on the commutative case…

To study the question of whether every two-dimensional Pr\"ufer domain possesses the stacked bases property, we consider the particular case of the Pr\"ufer domains formed by integer-valued polynomials. The description of the spectrum of…

This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…

Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…