Elimination by Substitution
Abstract
Let be a field and . The technique of elimination by substitution is based on discovering a coherently -separating tuple of polynomials in an ideal , i.e., on finding polynomials such that with . Here we elaborate on this technique in the case when is non-negatively graded. The existence of a coherently -separating tuple is reduced to solving several -module membership problems. Best separable re-embeddings, i.e., isomorphisms with maximal , are found degree-by-degree. They turn out to yield optimal re-embeddings in the positively graded case. Viewing as a fibration over an affine space, we show that its fibers allow optimal -separating re-embeddings, and we provide a criterion for a fiber to be isomorphic to an affine space. In the last section we introduce a new technique based on the solution of a unimodular matrix problem which enables us to construct automorphisms of such that additional -separating re-embeddings are possible. One of the main outcomes is an algorithm which allows us to explicitly compute a homogeneous isomorphism between and a non-negatively graded polynomial ring if is regular.
Cite
@article{arxiv.2403.06415,
title = {Elimination by Substitution},
author = {Martin Kreuzer and Lorenzo Robbiano},
journal= {arXiv preprint arXiv:2403.06415},
year = {2024}
}
Comments
26 pages