Positive-characteristic validity of the singularity classification algorithm
Positive-characteristic validity of the singularity classification algorithm
Let be an algebraically closed field of characteristic , and let the paper's singularity-classification algorithm be denoted by Algorithm 1. Positive-characteristic hypothesis. The algorithm is valid over for every characteristic satisfying
This extends the algorithm beyond characteristic zero; whether these are the only necessary exclusions is part of the characteristic-dependent validity question considered by the paper.
Sources & referencesView supporting material
Primary source
Raymond van Bommel, Jordan Docking, Reynald Lercier and Elisa Lorenzo García, “Reduction of Plane Quartics and Dixmier-Ohno invariants”, arXiv:2401.13902 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.