Optimal Re-Embeddings of Border Basis Schemes

From MaRDI portal
Publication:6405212

arXiv2207.08115MaRDI QIDQ6405212FDOQ6405212


Authors: Martin Kreuzer, Le Ngoc Long, Lorenzo Robbiano Edit this on Wikidata


Publication date: 17 July 2022

Abstract: Border basis schemes are open subschemes of Hilbert schemes parametrizing 0-dimensional subschemes of mathbbPn of given length. They yield open coverings and are easy to describe and to compute with. Our topic is to find re-embeddings of border basis schemes into affine spaces of minimal dimension. Given P=K[X]=K[x1,dots,xn], an ideal IsubseteqlangleXangle, and a tuple Z of indeterminates, in previous papers the authors developed techniques for computing Z-separating re-embeddings of I, i.e., of isomorphisms Phi:P/IightarrowK[XsetminusZ]/(IcapK[XsetminusZ]). Here these general techniques are developed further and improved by constructing a new algorithm for checking candidate tuples Z and by using the Gr"obner fan of the linear part of I advantageously. Then we apply this to the ideals defining border basis schemes mathbbBmathcalO, where mathcalO is an order ideal of terms, and to their natural generating polynomials. The fact that these ideals are homogeneous w.r.t. the arrow grading allows us to look for suitable tuples Z more systematically. Using the equivalence of indeterminates modulo the square of the maximal ideal, we compute the Gr"obner fan of the linear part of the ideal quickly and determine which indeterminates should be in Z when we are looking for optimal re-embeddings. Specific applications include re-embeddings of border basis schemes where mathcalOsubseteqK[x,y] and where mathcalO consists of all terms up to some degree.













This page was built for publication: Optimal Re-Embeddings of Border Basis Schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6405212)