Name
Abstract | ||
|---|---|---|
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 Grobner basis and that Grobner 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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-642-54423-1_56 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Toric variety,Discrete mathematics,Combinatorics,Noetherian ring,Polynomial,Generating set of a group,Polynomial ring,Computer science,Gröbner basis,Divide and conquer algorithms,Cellular decomposition | Conference | 8392 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Deepanjan Kesh | 1 | 74 | 6.53 |
| Shashank K. Mehta | 2 | 45 | 11.65 |