Details:
Title  A divide and conquer method to compute binomial ideals.  Author(s)  Deepanjan Kesh, Shashank K. Mehta  Type  Book, Chapter in Book, Conference Proceeding  Abstract  A binomial is a polynomial with at most two terms. In this paper, we give a divideandconquer strategy to compute binomial ideals. This work is a generalization of the work done by the authors in [12,13] and is motivated by the fact that any algorithm to compute binomial ideals spends a significant amount of time computing Gröbner basis and that Gröbner basis computation is very sensitive to the number of variables in the ring. The divide and conquer strategy breaks the problem into subproblems in rings of lesser number of variables than the original ring. We apply the framework on five problems – radical, saturation, cellular decomposition, minimal primes of binomial ideals, and computing a generating set of a toric ideal.  ISBN  9783642544224/pbk 
URL 
http://link.springer.com/chapter/10.1007%2F9783642544231_56 
Language  English  Pages  648659  Publisher  Berlin: Springer  Year  2014  Edition  0  Translation 
No  Refereed 
No 
