REVIEW 1 cited by
A Galois-Theoretic Complexity Measure for Solving Systems of Algebraic Equations
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining polynomial roots. We explain why practical heuristics such as monodromy give (at least) lower bounds on this quantity, and discuss problems in geometry, optimization, statistics, and computer vision for which knowledge of the Galois width either leads to improvements over standard solution techniques or rules out this possibility entirely.
Forward citations
Cited by 1 Pith paper
-
Numerically Computing Galois Groups of Minimal Problems
A tutorial arguing that the Galois group and the Galois-width invariant characterize the intrinsic algebraic difficulty of minimal problems, with numerical monodromy code for the five-point problem.
Discussion (0). Continue with ORCID to comment.