The article presents an algorithm to compute a C[t]-module basis G for a given subalgebra A over a polynomial ring R = C[x] with a Euclidean domain C as the domain of coefficients and t a givenâ€¦ (More)

We consider the check of the involutive basis property in a polynomial context. In order to show that a finite generating set F of a polynomial ideal I is an involutive basis one must confirm twoâ€¦ (More)

We describe an algorithm that, given a positive integer N , computes a GrÃ¶bner basis of the ideal of polynomial relations among Dedekind Î·functions of level N , i. e., among the elements of {Î·(Î´1Ï„),â€¦ (More)

In this article, we consider the classical Jacobi theta functions Î¸i(z), i = 1, 2, 3, 4 and show that the ideal of all polynomial relations among them with coefficients in K := Q(Î¸2(0|Ï„), Î¸3(0|Ï„),â€¦ (More)

Systems of polynomial equations often have symmetries. In solving such a system using Buchberger's algorithm, the symmetries are neglected. Incorporating symmetries into the solution process enablesâ€¦ (More)

Differential problems are ubiquitous in mathematical modeling of physical and scientific problems. Algebraic analysis of differential systems can help in determining qualitative and quantitativeâ€¦ (More)

We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R and w1x, . . . , wdx are linear forms on R , maxâ€¦ (More)