Staff View
Symbolic-computational methods in combinatorial game theory and Ramsey theory

Descriptive

TypeOfResource
Text
TitleInfo (ID = T-1)
Title
Symbolic-computational methods in combinatorial game theory and Ramsey theory
Identifier
ETD_1205
Identifier (type = hdl)
http://hdl.rutgers.edu/1782.1/rucore10001600001.ETD.000054841
Language
LanguageTerm (authority = ISO639-2); (type = code)
eng
Genre (authority = marcgt)
theses
Subject (ID = SBJ-1); (authority = RUETD)
Topic
Mathematics
Subject (ID = SBJ-2); (authority = ETD-LCSH)
Topic
Game theory
Subject (ID = SBJ-3); (authority = ETD-LCSH)
Topic
Ramsey theory
Abstract (type = abstract)
This thesis is a contribution to the emerging fleld of experimental rigorous mathematics, where one uses symbolic computation to conjecture proof-plans, and then proceeds to verify the conjectured proofs rigorously. The proved results, in addition to their independent interest, should also be viewed as case studies in this budding methodology. We now proceed to described the specific results presented in this dissertation. We first develop a finite-state automata approach, implemented in a Maple package ToadsAndFrogs, for conjecturing, and then rigorously proving, values for large families of positions in Richard Guy's combinatorial game Toads and Frogs". In particular, we prove conjectures of Jeff Erickson. We also discuss the values of all positions with exactly one ¤;Ta¤¤Fa;Ta¤¤¤FFF;Ta¤¤Fb, Ta¤¤¤Fb. We next consider the generalized chess problem of checkmating a king with a king and a rook on an m x n board at a specific starting position. We analyze the fastest way to checkmate. We also consider a problem posed by Ronald Graham about the minimum number,
over all 2-colorings of [1; n], of generalized so-called Schur triples, i.e. monochromatic triples of the form (x; y; x + ay) a [greater than or equal to symbol] 1. (The case a = 1 corresponds to the classical Schur triples). In addition to giving a completely new proof of the already known case of a = 1, we show that the minimum number of such triples is at most n2 2a(a2+2a+3) +O(n)
when a [greater than or equal to symbol] 2. We also find a new upper bound for the minimum number, over all r-colorings of [1; n], of monochromatic Schur triples, for r [greater than or equal to symbol] 3. Finally, in yet a different direction, we find closed-form expressions for the second moment of the random variable
umber of monochromatic Schur triples" defined on
the sample space of all r-colorings of the first n integers, and second and even higher moments for the number of monochromatic complete graphs Kk in Kn. In addition to their considerable independent interest, these formulas would hopefully be instrumental
in improving the extremely weak known lower bounds for the asymptotics of Ramsey number.
PhysicalDescription
Form (authority = gmd)
electronic resource
Extent
ix, 135 p. : ill.
InternetMediaType
application/pdf
InternetMediaType
text/xml
Note (type = degree)
Ph.D.
Note
Includes abstract
Note
Vita
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Thotsaporn "Aek" Thanatipanonda
Name (ID = NAME-1); (type = personal)
NamePart (type = family)
Thanatipanonda
NamePart (type = given)
Thotsaporn
Role
RoleTerm (authority = RULIB)
author
DisplayForm
Thotsaporn Thanatipanonda
Name (ID = NAME-2); (type = personal)
NamePart (type = family)
Zeilberger
NamePart (type = given)
Doron
Role
RoleTerm (authority = RULIB)
chair
Affiliation
Advisory Committee
DisplayForm
Doron Zeilberger
Name (ID = NAME-3); (type = personal)
NamePart (type = family)
Retakh
NamePart (type = given)
Vladimir
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Vladimir Retakh
Name (ID = NAME-4); (type = personal)
NamePart (type = family)
Saks
NamePart (type = given)
Michael
Role
RoleTerm (authority = RULIB)
internal member
Affiliation
Advisory Committee
DisplayForm
Michael Saks
Name (ID = NAME-5); (type = personal)
NamePart (type = family)
Sloane
NamePart (type = given)
Neil
Role
RoleTerm (authority = RULIB)
outside member
Affiliation
Advisory Committee
DisplayForm
Neil Sloane
Name (ID = NAME-1); (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (ID = NAME-2); (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
OriginInfo
DateCreated (qualifier = exact)
2008
DateOther (qualifier = exact); (type = degree)
2008
Place
PlaceTerm (type = code)
xx
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Identifier (type = doi)
doi:10.7282/T30G3K3F
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (AUTHORITY = GS); (ID = rulibRdec0006)
The author owns the copyright to this work.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
RightsHolder (ID = PRH-1); (type = personal)
Name
FamilyName
Thanatipanonda
GivenName
Thotsaporn
Role
Copyright Holder
RightsEvent (ID = RE-1); (AUTHORITY = rulib)
Type
Permission or license
DateTime
2008-09-24 17:22:35
AssociatedEntity (ID = AE-1); (AUTHORITY = rulib)
Role
Copyright holder
Name
Thotsaporn Thanatipanonda
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject (ID = AO-1); (AUTHORITY = rulib)
Type
License
Name
Author Agreement License
Detail
I hereby grant to the Rutgers University Libraries and to my school the non-exclusive right to archive, reproduce and distribute my thesis or dissertation, in whole or in part, and/or my abstract, in whole or in part, in and from an electronic format, subject to the release date subsequently stipulated in this submittal form and approved by my school. I represent and stipulate that the thesis or dissertation and its abstract are my original work, that they do not infringe or violate any rights of others, and that I make these grants as the sole owner of the rights to my thesis or dissertation and its abstract. I represent that I have obtained written permissions, when necessary, from the owner(s) of each third party copyrighted matter to be included in my thesis or dissertation and will supply copies of such upon request by my school. I acknowledge that RU ETD and my school will not distribute my thesis or dissertation or its abstract if, in their reasonable judgment, they believe all such rights have not been secured. I acknowledge that I retain ownership rights to the copyright of my work. I also retain the right to use all or part of this thesis or dissertation in future works, such as articles or books.
Back to the top

Technical

ContentModel
ETD
MimeType (TYPE = file)
application/pdf
MimeType (TYPE = container)
application/x-tar
FileSize (UNIT = bytes)
501760
Checksum (METHOD = SHA1)
a65ccf0f62f7d0da16109075a2ba38a9a48f1dc2
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024