{"title":"希尔伯特之后的齐恩豪斯变换","authors":"J. Wolfson","doi":"10.4171/LEM/66-3/4-9","DOIUrl":null,"url":null,"abstract":"Let RD(n) denote the minimum d for which there exists a formula for the roots of the general degree n polynomial using only algebraic functions of d or fewer variables. In 1927, Hilbert sketched how the 27 lines on a cubic surface could be used to construct a 4-variable formula for the general degree 9 polynomial (implying $RD(9)\\le 4$). In this paper, we turn Hilbert's sketch into a general method. We show this method produces best-to-date upper bounds on RD(n) for all n, improving earlier results of Hamilton, Sylvester, Segre and Brauer.","PeriodicalId":278201,"journal":{"name":"arXiv: Algebraic Geometry","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Tschirnhaus transformations after Hilbert\",\"authors\":\"J. Wolfson\",\"doi\":\"10.4171/LEM/66-3/4-9\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let RD(n) denote the minimum d for which there exists a formula for the roots of the general degree n polynomial using only algebraic functions of d or fewer variables. In 1927, Hilbert sketched how the 27 lines on a cubic surface could be used to construct a 4-variable formula for the general degree 9 polynomial (implying $RD(9)\\\\le 4$). In this paper, we turn Hilbert's sketch into a general method. We show this method produces best-to-date upper bounds on RD(n) for all n, improving earlier results of Hamilton, Sylvester, Segre and Brauer.\",\"PeriodicalId\":278201,\"journal\":{\"name\":\"arXiv: Algebraic Geometry\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Algebraic Geometry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4171/LEM/66-3/4-9\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Algebraic Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4171/LEM/66-3/4-9","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Let RD(n) denote the minimum d for which there exists a formula for the roots of the general degree n polynomial using only algebraic functions of d or fewer variables. In 1927, Hilbert sketched how the 27 lines on a cubic surface could be used to construct a 4-variable formula for the general degree 9 polynomial (implying $RD(9)\le 4$). In this paper, we turn Hilbert's sketch into a general method. We show this method produces best-to-date upper bounds on RD(n) for all n, improving earlier results of Hamilton, Sylvester, Segre and Brauer.