Varieties in $(\mathbf{P}^1(\bar{\mathbf{F}}))^n$ by Elimination and Extension

TL;DR

This paper develops a symbolic algebraic method using coordinates and disjoint parts to compute varieties in projective space, with an implementation in Macaulay2, advancing the algebraic theory of desingularization.

Contribution

It introduces a recursive algorithm for variety computation via elimination and extension in projective space, incorporating coordinate-based partitioning and inequalities.

Findings

Algorithm successfully computes varieties in $(\mathbf{P}^1(\bar{\mathbf{F}}))^n$

Includes Macaulay2 implementation and example

Lays groundwork for algebraic desingularization theory

Abstract

This paper contains a theory of elimination and extension to compute varieties symbolically, based on using {\em coordinates} from $(\mathbf{P}^1(\bar{\mathbf{F}}))^n$ and disjoint {\em parts} of varieties (defined by both equality and inequality constraints), leading to a recursive algorithm to compute said varieties by extension at the level of {\em parts} of a variety. {\sc Macaulay2} code for this is included along with an example. This is a first step in the author's project of giving a purely algebraic theory of desingularization of function fields, in that that project relies heavily on using this type of coordinates for function field elements and on partitioning a set of valuations into disjoint sets similarly.