Related papers: Groebner bases and gradings for partial difference…
We consider fine G-gradings on M_n(C) (i.e. gradings of the matrix algebra over the complex numbers where each component is 1 dimensional). Groups which provide such a grading are known to be solvable. We consider the T-ideal of G-graded…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
In this paper, we make a contribution to the computation of Gr\"obner bases. For polynomial reduction, instead of choosing the leading monomial of a polynomial as the monomial with respect to which the reduction process is carried out, we…
In this paper, we describe new methods to compute the radical (resp. real radical) of an ideal, assuming it complex (resp. real) variety is finite. The aim is to combine approaches for solving a system of polynomial equations with dual…
Let J be a strongly stable monomial ideal in P=k[X0,...,Xn] and let BSt(J) be the family of all the homogeneous ideals in P such that the set N(J) of all the monomials that do not belong to J is a k-vector basis of the quotient P/I. We show…
An affine variety induces the structure of an algebraic matroid on the set of coordinates of the ambient space. The matroid has two natural decorations: a circuit polynomial attached to each circuit, and the degree of the projection map to…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
Multiplication of polynomials is among key operations in computer algebra which plays important roles in developing techniques for other commonly used polynomial operations such as division, evaluation/interpolation, and factorization. In…
Given a sequence of related modules $M_n$ defined over a sequence of related polynomial rings, one may ask how to simultaneously compute a finite Gr\"obner basis for each $M_n$. Furthermore, one may ask how to simultaneously compute the…
We present a new effective Nullstellensatz with bounds for the degrees which depend not only on the number of variables and on the degrees of the input polynomials but also on an additional parameter called the {\it geometric degree of the…
The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…
In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function, assuming that the minimizer ideal is zero-dimensional. Our method is a…
We present a method for nonlinear parametric optimization based on algebraic geometry. The problem to be studied, which arises in optimal control, is to minimize a polynomial function with parameters subject to semialgebraic constraints.…
A graded-division algebra is an algebra graded by a group such that all nonzero homogeneous elements are invertible. This includes division algebras equipped with an arbitrary group grading (including the trivial grading). We show that a…
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
Given a parametric polynomial ideal I, the algorithm DISPGB, introduced by the author in 2002, builds up a binary tree describing a dichotomic discussion of the different reduced Groebner bases depending on the values of the parameters,…
We develop the theory of difference algebraic groups in the case where we have finitely many pairwise commuting difference operators. We show that the defining ideal of a difference algebraic group is finitely generated as a difference…
In this article, we study bounded-below locally finite $\mathbb{Z}$-graded algebras, which are referred to as commonly graded algebras in literature. Commonly graded algebras have almost similar theory as that of connected graded algebras,…