東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Some Take-Away Games on Discrete Str...

Barnard, Kristen M.

FindBook

Google Book

Amazon

博客來

Some Take-Away Games on Discrete Structures.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Some Take-Away Games on Discrete Structures./
作者:	Barnard, Kristen M.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2017,
面頁冊數:	151 p.
附註:	Source: Dissertation Abstracts International, Volume: 78-11(E), Section: B.
Contained By:	Dissertation Abstracts International78-11B(E).
標題:	Mathematics. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10628788
ISBN:	9781369989069

Some Take-Away Games on Discrete Structures.
Barnard, Kristen M.

Some Take-Away Games on Discrete Structures. - Ann Arbor : ProQuest Dissertations & Theses, 2017 - 151 p.

Source: Dissertation Abstracts International, Volume: 78-11(E), Section: B.

Thesis (Ph.D.)--University of Kentucky, 2017.

The game of Subset Take-Away is an impartial combinatorial game posed by David Gale in 1974. The game can be played on various discrete structures, including but not limited to graphs, hypergraphs, polygonal complexes, and partially ordered sets. While a universal winning strategy has yet to be found, results have been found in certain cases. In 2003 R. Riehemann focused on Subset Take-Away on bipartite graphs and produced a complete game analysis by studying nim-values. In this work, we extend the notion of Take-Away on a bipartite graph to Take-Away on particular hypergraphs, namely oddly-uniform hypergraphs and evenly-uniform hypergraphs whose vertices satisfy a particular coloring condition. On both structures we provide a complete game analysis via nim-values. From here, we consider different discrete structures and slight variations of the rules for Take-Away to produce some interesting results. Under certain conditions, polygonal complexes exhibit a sequence of nim-values which are unbounded but have a well-behaved pattern. Under other conditions, the nim-value of a polygonal complex is bounded and predictable based on information about the complex itself. We introduce a Take-Away variant which we call Take-As-Much-As-You-Want, and we show that, again, nim-values can grow without bound, but fortunately they are very easily described for a given graph based on the total number of vertices and edges of the graph. Finally we consider Take-Away on a specific type of partially ordered set which we call a rank-complete poset. We have results, again via an analysis of nim-values, for Take-Away on a rank-complete poset for both ordinary play as well as misere play.

ISBN: 9781369989069Subjects--Topical Terms:

515831
Mathematics.

Some Take-Away Games on Discrete Structures.
LDR:02549nmm a2200289 4500 001 2155546
005 20180426091050.5
008 190424s2017 ||||||||||||||||| ||eng d
020 $a 9781369989069
035 $a (MiAaPQ)AAI10628788
035 $a AAI10628788
040 $a MiAaPQ $c MiAaPQ
100 1 $a Barnard, Kristen M. $3 3343280
245 1 0 $a Some Take-Away Games on Discrete Structures.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2017
300 $a 151 p.
500 $a Source: Dissertation Abstracts International, Volume: 78-11(E), Section: B.
502 $a Thesis (Ph.D.)--University of Kentucky, 2017.
520 $a The game of Subset Take-Away is an impartial combinatorial game posed by David Gale in 1974. The game can be played on various discrete structures, including but not limited to graphs, hypergraphs, polygonal complexes, and partially ordered sets. While a universal winning strategy has yet to be found, results have been found in certain cases. In 2003 R. Riehemann focused on Subset Take-Away on bipartite graphs and produced a complete game analysis by studying nim-values. In this work, we extend the notion of Take-Away on a bipartite graph to Take-Away on particular hypergraphs, namely oddly-uniform hypergraphs and evenly-uniform hypergraphs whose vertices satisfy a particular coloring condition. On both structures we provide a complete game analysis via nim-values. From here, we consider different discrete structures and slight variations of the rules for Take-Away to produce some interesting results. Under certain conditions, polygonal complexes exhibit a sequence of nim-values which are unbounded but have a well-behaved pattern. Under other conditions, the nim-value of a polygonal complex is bounded and predictable based on information about the complex itself. We introduce a Take-Away variant which we call Take-As-Much-As-You-Want, and we show that, again, nim-values can grow without bound, but fortunately they are very easily described for a given graph based on the total number of vertices and edges of the graph. Finally we consider Take-Away on a specific type of partially ordered set which we call a rank-complete poset. We have results, again via an analysis of nim-values, for Take-Away on a rank-complete poset for both ordinary play as well as misere play.
590 $a School code: 0102.
650 4 $a Mathematics. $3 515831
650 4 $a Theoretical mathematics. $3 3173530
650 4 $a Applied mathematics. $3 2122814
690 $a 0405
690 $a 0642
690 $a 0364
710 2 $a University of Kentucky. $b Mathematics. $3 3343281
773 0 $t Dissertation Abstracts International $g 78-11B(E).
790 $a 0102
791 $a Ph.D.
792 $a 2017
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=10628788