Upper bounds on resolvent degree via Sylvester's obliteration algorithm

MaRDI QIDQ2680143

Alexander J. Sutherland, Curtis Heberle

Publication date: 27 January 2023

Published in: The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2110.08670

zbMATH Keywords

resolvent degreegeneral polynomial of degree \(n\)obliteration algorithm

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Equations in general fields (12E12) Global ground fields in algebraic geometry (14G25)

Related Items (1)

Generalized versality, special points, and resolvent degree for the sporadic groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the resolvent problem
• On the variety of linear spaces contained in a complete intersection
• Resolvent degree, Hilbert's 13th problem and geometry
• Tschirnhaus transformations after Hilbert
• From Hilbert's 13th problem to essential dimension and back
• The algebraic equations of degrees 5, 9, 157,\dots , and the arithmetic upon an algebraic variety
• Classical Algebraic Geometry
• A QUANTITATIVE FORMULATION OF SYLVESTER'S LAW OF INERTIA

This page was built for publication: Upper bounds on resolvent degree via Sylvester's obliteration algorithm