Related papers: Reduced Groebner Bases With Double Exponential Car…

We present upper bounds on the bit-size of coefficients of non-radical lexicographical Groebner bases in purely triangular form (triangular sets) of dimension zero. This extends a previous work [Dahan-Schost, Issac'2004], constrained to…

Given a finite set of closed rational points of affine space over a field, we give a Gr\"obner basis for the lexicographic ordering of the ideal of polynomials which vanish at all given points. Our method is an alternative to the…

For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…

For any quantum group of finite ADE type, we prove a new formula for the standard bilinear form evaluated at monomials. Combining this with ideas from the Lusztig-Shoji algorithm, we obtain a new algorithm that computes the canonical basis.…

We consider three modifications of our involutive algorithm for computing Janet bases. These modifications are related to degree compatible monomial orders and specify selection strategies for non-multiplicative prolongations. By using the…

We compute the Groebner basis of a system of polynomial equations related to the Jacobian conjecture, and describe completely the solution set.

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

Let J be a strongly stable monomial ideal in S=K[x_1,...,x_n] and let Mf(J) be the family of all homogeneous ideals I in S such that the set of all terms outside J is a K-vector basis of the quotient S/I. We show that an ideal I belongs to…

In the Grothendieck cohomology of a flag variety G/H there are two canonical additive bases, namely, the Demazure basis and the Grothendieck basis We present explicit formulae that reduce the multiplication of these basis elements to the…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

The so called generalized down-up algebras are revisited from a viewpoint of Gr\"obner basis theory. Particularly it is shown explicitly that generalized down-up algebras are solvable polynomial algebras (provided $\lambda\omega\ne 0$), and…

Let $F$ be a field of characteristic zero, $G$ be a group and $R$ be the algebra $M_n(F)$ with a $G$-grading. Bahturin and Drensky proved that if $R$ is an elementary and the neutral component is commutative then the graded identities of…

A topological space TO(S) of total orderings on any given set S is introduced and it is shown that TO(S) is compact if S is countable. The set NO(N) of all normal orderings of the nth Weyl algebra W is a closed subspace of TO(N), where N is…

It is proved that the universal degree bound for separating polynomial invariants of a finite abelian group (in non-modular characteristic) is strictly smaller than the universal degree bound for generators of polynomial invariants, unless…

We derive Groebner bases for Lauricella's hypergeometric differential equations $I_A(m), I_B(m), I_C(m)$ with respect to a monomial order. By using these Groebner bases, we determine characteristic varieties and the singular loci of…

A characteristic pair is a pair (G,C) of polynomial sets in which G is a reduced lexicographic Groebner basis, C is the minimal triangular set contained in G, and C is normal. In this paper, we show that any finite polynomial set P can be…

Let $F$ be a finite field with characteristic $p > 2$ and let $G$ be the unitary Grassmann algebra generated by an infinite dimensional vector space $V$ over $F$. In this paper, we determine a basis of the $\mathbb{Z}_{2}$-graded polynomial…

In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases…

We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular,…

Gr\"obner bases, in their noncommutative version, and word reversing are methods for solving the word problem of a presented monoid, and both rely on iteratively completing the initial list of relations. Simple examples may suggest to…