G.N. Chebotarev's "On the Problem of Resolvents"

Alexander J. Sutherland

Home/Archive/arXiv

arXiv · 2107.01006

G.N. Chebotarev's "On the Problem of Resolvents"

Alexander J. Sutherland

View original source ↗Read source document ↗Export metadata ↓

Abstract

This is an English translation of G.N. Chebotarev's classical paper "On the Problem of Resolvents," which was originally written in Russian and published in Vol. 114, No. 2 of the Scientific Proceedings of the V.I. Ulyanov-Lenin Kazan State University. In this paper, Chebotarev extends the method in Wiman's "On the Application of Tschirnhaus Transformations to the Reduction of Algebraic Equations" to argue that the general polynomial of degree 21 admits a solution using algebraic functions of at most 15 variables. However, his and Wiman's proofs assume that certain intersections in affine space are generic without proof.

Explore related subjects

math.HO math.AG

Keep this discovery

BibTeX RIS

Alexander J. Sutherland. 2021-06-17. G.N. Chebotarev's "On the Problem of Resolvents". https://arxiv.org/abs/2107.01006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Perspectives on the unit distance problem

This is a survey on an old open problem in combinatorics called the unit distance problem, and the field of mathematics around it, called incidence geometry. What do we know about the problem? Why is it difficult? How does it connect with other parts of math?

math.HO↗

arXiv2026

A Categorical Approach to Euclidean Ratios and Proportions

A categorial approach to the non-metric geometry in Books V and VI of Euclid's \textit{Elements} is presented. Specifically, we introduce a diagrammatic syntax that can be overlaid immediately on his diagrams, thus bridging intuitive presentation with fidelity to Euclid's arguments. This syntax makes complicated definitions like V.5, and indeed the arguments throughout books V and VI, including arguments about similar figures, intuitively clear. We show in an appendix that this syntax can be used to solve a puzzle regarding ancient mathematics. Finally, we offer evidence that this approach to Euclidean diagrams is rooted in the Aristotelian tradition itself, and that a similar syntax was utilized, in antiquity, for related questions of numeric and proportions. Thus the syntax is plausibly faithful to Euclid's own thought-world, and not an outside-imposition.

math.HO↗

arXiv2026

Some Early Results by Tutte Regarding the Cycle Double Cover Conjecture in 1948

OpenAI recently announced a proof of the Cycle Double Cover (CDC) Conjecture. Most media reports have characterized it as a 50-year-old open problem. In reality, according to a 1987 letter from Tutte to Fleischner, the Cycle Double Cover Problem has been open for at least 80 years. Two early results regarding the CDC conjecture were established in one of Tutte's 1949 publications.

math.HO↗