A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Computing lattice ideals of unions of monomial curves
2004
Journal of symbolic computation
In this paper we present a combinatorial study of binomial ideals of dimension 1 of k[X 1 , . . . , X n ], using monomial parametrizations of the irreducible affine curves defined by their associated primes. We find an algorithm that checks whether or not the ideal of a union of monomial curves is binomial and another one that calculates curves such that their associated ideal is a prescribed lattice ideal.
doi:10.1016/j.jsc.2004.03.004
fatcat:edevn4lurvbgxptvat4t3xrrsy