An algorithm for checking whether the toric ideal of an affine monomial curve is a complete intersection (Q2469234)

The aim of this paper is to give an algorithm in order to check if an affine monomial curve in \(K^n\) is a complete intersection. Let me recall that ideals defining affine monomial curves are particular cases of toric ideals, so all the theory developed by many people applies here. A good an old reference for this is the book of \textit{E. Kunz} [Introduction to algebraic geometry. Vieweg Studium: Aufbaukurs Mathematik. 87. Wiesbaden: Vieweg (1997; Zbl 0885.14001)]. On the other hand a monomial affine curve is also given by a numerical semigroup. The problem of recognize a complete intersection from this semigroup is a general and hard problem. Some years ago a solution was given by several authors by the gluing operations on semigroups. In the paper under review the authors follow another different way from gluing. The algorithm developed here is more closer (and can be consider as an improvement) to the former algorithm by \textit{C. Delorme} [Ann. Sci. Éc. Norm. Supér. (4) 9, 145--154 (1976; Zbl 0325.20065)]. The algorithm is this paper was implemented in Singular and it is proved by given some examples that it is faster than Delorme algorithm.