Positive-characteristic validity of the singularity classification algorithm

Let K\overline{K} be an algebraically closed field of characteristic pp, and let the paper's singularity-classification algorithm be denoted by Algorithm 1. Positive-characteristic hypothesis. The algorithm is valid over K\overline{K} for every characteristic satisfying

p2,3,5,7.p\neq 2,3,5,7.

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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.