Algorithms for checking zero-dimensional complete intersections (Q2154977)

Let \(R = K[x_1,\dots,x_n]/I\) be a zero-dimensional affine \(K\)-algebra, where \(K\) is an arbitrary field. Equivalently the authors consider a 0-dimensional affine scheme \(X \subset \mathbb{A}_K^n\) and consider the ideal \(I = I_X\) in \(K[x_1,\dots,x_n]\). It is of great interest to know if \(R\) is a complete intersection, i.e. if \(I\) can be generated by \(ht(I)\) elements. The authors produce effective algorithms for checking whether \(R\) is a complete intersection at a maximal ideal, whether \(R\) is locally a complete intersection, and whether \(R\) is a strict complete intersection. The main tool is a characterization given by \textit{H. Wiebe} [Math. Ann. 179, 257--274 (1969; Zbl 0169.05701)] of 0-dimensional local complete intersections via the 0-th Fitting ideal of the maximal ideal. The authors work in the affine setting, but they point out that by using homogenization and dehomogenization we can move between the affine and the projective settings. Several algorithms have been given in the past, but this paper gives more general algorithms. An advantage of this approach is that it allows us to get a description of which generators of \(I\) form a regular sequence (respectively a strict regular sequence), and the approach works over an arbitrary base field \(K\).