現代数学の系譜 工学物理雑談 古典ガロア理論も読む46

47 名前：現代数学の系譜 雑談 古典ガロア理論も読む mailto:sage [2017/11/12(日) 08:58:35.25 ID:cTg/FCp5.net] >>43 つづき で、Alan D. Taylor さんの２つの論文のPDFリンク切れているから、検索し直した 下記、ご参照 １） www.cs.umd.edu/~gasarch/ William Gasarch Professor of Computer Science Affiliate of Mathematics University of Maryland at College Park www.cs.umd.edu/~gasarch/TOPICS/hats/hats.html Papers on Hat Problems I want to read by William Gasarch 21. An Introduction to Infinite Hat Problems by Christopher Hardin and Alan Taylor. HAT GAME- infinite number of people, need to get all but a finite number of them right. Needs AC. Infinite Hats and AC www.cs.umd.edu/~gasarch/TOPICS/hats/infinite-hats-and-ac.pdf An Introduction to Infinite Hat Problems Chris Hardin and Alan Taylor THE MATHEMATICAL INTELLIGENCER 2008 Springer Science+Business Media, Inc ２） citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.7027&rank=2 A peculiar connection between the Axiom of Choice and predicting the future THE MATHEMATICAL ASSOCIATION OF AMERICA Monthly February 2008 citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.365.7027&rep=rep1&type=pdf ３）Taylorさん https://en.wikipedia.org/wiki/Alan_D._Taylor Alan D. Taylor Alan Dana Taylor (born October 27, 1947) is an American mathematician who, with Steven Brams, solved the problem of envy-free cake-cutting for an arbitrary number of people with the Brams?Taylor procedure. Taylor received his Ph.D. in 1975 from Dartmouth College.[2] He currently is the Marie Louise Bailey professor of mathematics at Union College, in Schenectady, New York. 以上

---

---

[ 続きを読む ] / [ 携帯版 ]

read.cgi ver5.27 [feat.BBS2 +1.6] / e.0.2 (02/09/03) / eucaly.net products.
担当:undef