Paper Info
Title
A saturation algorithm for homogeneous binomial ideals
Abstract
Let k[x 1, …, x n ] be a polynomial ring in n variables, and let I ⊂ k[x 1, …, x n ] be a homogeneous binomial ideal. We describe a fast algorithm to compute the saturation, I:(x 1 ⋯ x n ) ∞ . In the special case when I is a toric ideal, we present some preliminary results comparing our algorithm with Project and Lift by Hemmecke and Malkin.
Year
DOI
Venue
2011
10.1145/2016567.2016586
ACM Communications in Computer Algebra
Keywords
DocType
Volume
homogeneous binomial ideal,special case,saturation algorithm,n variable,preliminary result,toric ideal,polynomial ring,fast algorithm
Conference
45
Issue
ISSN
Citations 
1/2
0302-9743
0
PageRank 
References 
Authors
0.34
9
2
Name
Order
Citations
PageRank
Deepanjan Kesh1746.53
Shashank K. Mehta24511.65