0438現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE
2018/01/13(土) 10:14:15.84ID:rUYSYDibhttp://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
2)
http://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
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.365.7027&rep=rep1&type=pdf
3)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.
以上
つづく