希尔伯特的第三个问题

100 Years of Math Milestones Pub Date : 2019-06-12 DOI:10.1090/mbk/121/68

D. Erman

{"title":"希尔伯特的第三个问题","authors":"D. Erman","doi":"10.1090/mbk/121/68","DOIUrl":null,"url":null,"abstract":"for 21 Mar 2013 In 1900 David Hilbert proposed a famous list of 23 open problems. The third problem asked: Given two polyhedra of equal volume, can you always cut the first one into finitely many pieces (with scissors) and reassemble the pieces to form the second? This problem was the first of these problems to be solved, by Hilbert's own student Max Dehn. The answer was \" no \". I will discuss a modern, simplified version of Dehn's proof.","PeriodicalId":423691,"journal":{"name":"100 Years of Math Milestones","volume":"743 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Hilbert’s third problem\",\"authors\":\"D. Erman\",\"doi\":\"10.1090/mbk/121/68\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"for 21 Mar 2013 In 1900 David Hilbert proposed a famous list of 23 open problems. The third problem asked: Given two polyhedra of equal volume, can you always cut the first one into finitely many pieces (with scissors) and reassemble the pieces to form the second? This problem was the first of these problems to be solved, by Hilbert's own student Max Dehn. The answer was \\\" no \\\". I will discuss a modern, simplified version of Dehn's proof.\",\"PeriodicalId\":423691,\"journal\":{\"name\":\"100 Years of Math Milestones\",\"volume\":\"743 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-06-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"100 Years of Math Milestones\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/mbk/121/68\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"100 Years of Math Milestones","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/mbk/121/68","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

1900年，大卫·希尔伯特提出了一个著名的23个开放问题列表。第三道题问的是:给定两个体积相等的多面体，你是否总能(用剪刀)将第一个多面体剪成有限多块，然后将它们重新组合成第二个多面体?这个问题是这些问题中第一个被希尔伯特自己的学生马克斯·德恩解决的。答案是“不”。我将讨论Dehn证明的一个现代简化版本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Hilbert’s third problem

for 21 Mar 2013 In 1900 David Hilbert proposed a famous list of 23 open problems. The third problem asked: Given two polyhedra of equal volume, can you always cut the first one into finitely many pieces (with scissors) and reassemble the pieces to form the second? This problem was the first of these problems to be solved, by Hilbert's own student Max Dehn. The answer was " no ". I will discuss a modern, simplified version of Dehn's proof.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助