Staff View
An exploration of nested recurrences using experimental mathematics

Descriptive

TitleInfo
Title
An exploration of nested recurrences using experimental mathematics
Name (type = personal)
NamePart (type = family)
Fox
NamePart (type = given)
Nathan Harel
DisplayForm
Nathan Harel Fox
Role
RoleTerm (authority = RULIB)
author
Name (type = personal)
NamePart (type = family)
Zeilberger
NamePart (type = given)
Doron
DisplayForm
Doron Zeilberger
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
chair
Name (type = personal)
NamePart (type = family)
Kopparty
NamePart (type = given)
Swastik
DisplayForm
Swastik Kopparty
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Komlos
NamePart (type = given)
Janos
DisplayForm
Janos Komlos
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
internal member
Name (type = personal)
NamePart (type = family)
Sloane
NamePart (type = given)
Neil
DisplayForm
Neil Sloane
Affiliation
Advisory Committee
Role
RoleTerm (authority = RULIB)
outside member
Name (type = corporate)
NamePart
Rutgers University
Role
RoleTerm (authority = RULIB)
degree grantor
Name (type = corporate)
NamePart
Graduate School - New Brunswick
Role
RoleTerm (authority = RULIB)
school
TypeOfResource
Text
Genre (authority = marcgt)
theses
OriginInfo
DateCreated (qualifier = exact)
2017
DateOther (qualifier = exact); (type = degree)
2017-05
CopyrightDate (encoding = w3cdtf); (qualifier = exact)
2017
Place
PlaceTerm (type = code)
xx
Language
LanguageTerm (authority = ISO639-2b); (type = code)
eng
Abstract (type = abstract)
Broadly speaking, Experimental Mathematics is the philosophy that computers are a valuable tool that should be used extensively in mathematical research. Here, we apply this philosophy to the study of integer sequences arising from nested recurrence relations. The most widely studied nested recurrence is the Hofstadter Q-recurrence: Q(n) = Q(n − Q(n − 1)) + Q(n − Q(n − 2)). Hofstadter considered this recurrence with the initial condition Q(1) = Q(2) = 1, and the resulting sequence has much apparent structure. But, almost nothing has been rigorously proved about it. Others have modified the recurrence, the initial conditions, or both, to obtain related but more predictable sequences. We follow that vein and prove a number of unrelated theorems about sequences resulting from nested recurrences. Our first results relate to automatically finding (with proof) solutions to nested recurrences that are interleavings of linear-recurrent sequences. We then present a new nested-recurrent sequence whose terms increase monotonically with successive differences zero or one. Finally, we embark on an exploration of strange but predictable behaviors that result when recurrences are given various types of initial conditions.
Subject (authority = RUETD)
Topic
Mathematics
Subject (authority = ETD-LCSH)
Topic
Sequences (Mathematics)
RelatedItem (type = host)
TitleInfo
Title
Rutgers University Electronic Theses and Dissertations
Identifier (type = RULIB)
ETD
Identifier
ETD_7946
PhysicalDescription
Form (authority = gmd)
electronic resource
InternetMediaType
application/pdf
InternetMediaType
text/xml
Extent
1 online resource (xi, 227 p. : ill.)
Note (type = degree)
Ph.D.
Note (type = bibliography)
Includes bibliographical references
Note (type = statement of responsibility)
by Nathan Harel Fox
RelatedItem (type = host)
TitleInfo
Title
Graduate School - New Brunswick Electronic Theses and Dissertations
Identifier (type = local)
rucore19991600001
Location
PhysicalLocation (authority = marcorg); (displayLabel = Rutgers, The State University of New Jersey)
NjNbRU
Identifier (type = doi)
doi:10.7282/T3WD43FW
Genre (authority = ExL-Esploro)
ETD doctoral
Back to the top

Rights

RightsDeclaration (ID = rulibRdec0006)
The author owns the copyright to this work.
RightsHolder (type = personal)
Name
FamilyName
Fox
GivenName
Nathan
MiddleName
Harel
Role
Copyright Holder
RightsEvent
Type
Permission or license
DateTime (encoding = w3cdtf); (qualifier = exact); (point = start)
2017-04-06 15:12:19
AssociatedEntity
Name
Nathan Fox
Role
Copyright holder
Affiliation
Rutgers University. Graduate School - New Brunswick
AssociatedObject
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.
Copyright
Status
Copyright protected
Availability
Status
Open
Reason
Permission or license
Back to the top

Technical

RULTechMD (ID = TECHNICAL1)
ContentModel
ETD
OperatingSystem (VERSION = 5.1)
windows xp
CreatingApplication
Version
1.5
ApplicationName
pdfTeX-1.40.13
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2017-04-06T00:19:18
DateCreated (point = end); (encoding = w3cdtf); (qualifier = exact)
2017-04-06T00:19:18
Back to the top
Version 8.5.5
Rutgers University Libraries - Copyright ©2024