To integer programming, a ideals have been problems, which Hiroki Nakayama The University of Tokyo (Received October 27, 2003) Hiroshi Imai jases and standard pairs via toric ilgebraic approaches using Grobner k studied in recent years. In this paper, we consider a unimodular case, e.g., network flow enables us to analyze primal and dual problems in an equal setting. By combining existing resul...

In this research communication on commutative algebra it was proposed to deal with Grobner Bases and its applications in signals and systems domain.This is one of the pioneering communications in dealing with Cryo-EM Image Processing application using multi-disciplinary concepts involving thermodynamics and electromagnetics based on first principles approach. keywords: Commutative Algebra/HOL/S...

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

The principal result described in this report is the design and implementation of a parallel version of Buchberger's algorithm. Its correctness is stated and some experimental results are given. The first parts are devoted to a partial review of Grobner bases, of Buchberger's algorithm which computes them, and of some of their applications.

This paper discusses a result by Fliess about input-output equations [or polynomial systems with time delays, and strengthens the result somewhat. The proof given is more detailed and opens the way [or constructive methods [or determining the input-output behavior. Some such methods based on Grobner bases are described in detail. Furthermore, some connections with observability are exploited.