A Divide and Conquer Method to Compute Binomial Ideals

A binomial is a polynomial with at most two terms. In this paper, we give a divide-and-conquer 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...

Full description

Saved in:
Bibliographic Details
Published inLATIN 2014: Theoretical Informatics pp. 648 - 659
Main Authors Kesh, Deepanjan, Mehta, Shashank K.
Format Book Chapter
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2014
SeriesLecture Notes in Computer Science
Subjects
Input Ideal
Noetherian Ring
Partial Character
Polynomial Ring
Toric Variety
Online AccessGet full text

Cover

More Information
Summary:A binomial is a polynomial with at most two terms. In this paper, we give a divide-and-conquer 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:3642544223
9783642544224
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-54423-1_56