Grant: Discovery Grants Program - Individual
University of Toronto
$11,000.00
Nested recursions, simultaneous parameters and linear combinations of trees
EF 2013-14
Résumé
In my research I focus on developing methodologies to solve nested (also called self-referencing or meta-Fibonacci) recursions. Loosely speaking, these are recursions in which one or more of the arguments in the recursion depend upon earlier terms of the solution. The earliest examples of nested recursions appeared about forty years ago, and include the so-called ``Golomb"" recursion a(n) = a(n-a(n-1)) + 1, the Hofstadter Q-recursion Q(n) = Q(n-Q(n-1)) + Q(n-Q(n-2)) and the Conolly recursion C(n) = C(n-C(n-1))+C(n-1-C(n-2)).Together with my many students, I have been developing increasingly powerful techniques using computer methods and infinite trees labelled in preorder to solve progressively more complex families of nested recursions of this type.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
9256-2013
Name nom
Tanny, Stephen
Department département
Mathematics (St. George Campus)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2013
Award amount
11000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2914
Research subject group en
Pure mathematics
Research subject group fr
Mathématiques pures
Research subject en
Combinatorics
Research subject fr
Combinatoire
Partie
1
Nb partie
1
Application title
Nested recursions, simultaneous parameters and linear combinations of trees
Keyword
NSERC
Application summary
In my research I focus on developing methodologies to solve nested (also called self-referencing or meta-Fibonacci) recursions. Loosely speaking, these are recursions in which one or more of the arguments in the recursion depend upon earlier terms of the solution. The earliest examples of nested recursions appeared about forty years ago, and include the so-called ``Golomb"" recursion a(n) = a(n-a(n-1)) + 1, the Hofstadter Q-recursion Q(n) = Q(n-Q(n-1)) + Q(n-Q(n-2)) and the Conolly recursion C(n) = C(n-C(n-1))+C(n-1-C(n-2)).Together with my many students, I have been developing increasingly powerful techniques using computer methods and infinite trees labelled in preorder to solve progressively more complex families of nested recursions of this type.