[過去ﾛｸﾞ] 現代数学の系譜 工学物理雑談 古典ガロア理論も読む46 (692ﾚｽ)
上下前次1-新

---

このｽﾚｯﾄﾞは過去ﾛｸﾞ倉庫に格納されています｡
次ｽﾚ検索 歴削→次ｽﾚ 栞削→次ｽﾚ 過去ﾛｸﾞﾒﾆｭｰ

---

44(1): 現代数学の系譜 雑談 古典ガロア理論も読む ◆e.a0E5TtKE 2017/11/12(日)08:58 ID:cTg/FCp5(44/94) AAS
>>43 つづき

で、Alan D. Taylor さんの２つの論文のPDFリンク切れているから、検索し直した
下記、ご参照

１）
外部ﾘﾝｸ:www.cs.umd.edu
William Gasarch Professor of Computer Science Affiliate of Mathematics University of Maryland at College Park

外部ﾘﾝｸ[html]:www.cs.umd.edu
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

外部ﾘﾝｸ[pdf]:www.cs.umd.edu
An Introduction to Infinite Hat Problems Chris Hardin and Alan Taylor THE MATHEMATICAL INTELLIGENCER 2008 Springer Science+Business Media, Inc

２）
外部ﾘﾝｸ:citeseerx.ist.psu.edu
A peculiar connection between the Axiom of Choice and predicting the future THE MATHEMATICAL ASSOCIATION OF AMERICA Monthly February 2008
外部ﾘﾝｸ:citeseerx.ist.psu.edu

３）Taylorさん
外部ﾘﾝｸ:en.wikipedia.org
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.

以上

---

上下前次1-新書関写板覧索設栞歴

---

あと 648 ﾚｽあります
ｽﾚ情報 赤ﾚｽ抽出 画像ﾚｽ抽出 歴の未読ｽﾚ

---

ぬこの手 ぬこTOP 0.015s