Given an affine algebra over a field , where is an ideal in the polynomial ring , we examine the task of effectively calculating re-embeddings of , i.e., of presentations such that has fewer indeterminates. For cases when the number of indeterminates is large and Gröbner basis computations are infeasible, we have previously introduced the method of -separating re-embeddings. This method tries to detect polynomials of a special shape in which allow us to eliminate the indeterminates in the tuple by a simple substitution process. Here we improve this approach by showing that suitable candidate tuples can be found using the Gröbner fan of the linear part of . Then we describe a method to compute the Gröbner fan of a linear ideal, and we improve this computation in the case of binomial linear ideals using a cotangent equivalence relation. Finally, we apply the improved technique in the case of the defining ideals of border basis schemes.

生成讲解博客的中文版本

生成AI智能校验的中文版本