相关论文: A Note on the Control of Mortality for Nested Recu…
In this study, we explore the properties of certain solutions of Hofstadter's famous $V$-recurrence, defined by the nested recurrence relation $V(n)=V(n-V(n-1))+V(n-V(n-4))$. First, we discover the nature behind a finite chaotic…
In this paper, we study the three-term nested recurrence relation $B(n)=B(n-B(n-1))+B(n-B(n-2))+B(n-B(n-3))$ subject to initial conditions where the first $N$ terms are the integers $1$ through $N$. This recurrence is the three-term analog…
Nested recurrence relations are highly sensitive to their initial conditions. The best-known nested recurrence, the Hofstadter $Q$-recurrence, generates sequences displaying a wide variety of behaviors. Most famous among these is the…
We explore a family of nested recurrence relations with arbitrary levels of nesting, which have an interpretation in terms of fixed points of morphisms over a countably infinite alphabet. Recurrences in this family are related to a number…
I study the recurrence D(n)= D(D(n-1))+D(n-1-D(n-2)), D(1)=D(2)=1. Its definition has some similarity to that of Conway's sequence defined through a(n)= a(a(n-1))+a(n-a(n-1)), a(1)=a(2)=1. However, in contradistinction to the completely…
The Hofstadter $H$ sequence is defined by $H(1) = 1$ and $H(n) = n-H(H(H(n-1)))$ for $n > 1$. If $\alpha$ is the real root of $x^3+x=1$ we show that the numbers $\alpha H(n) \mod 1$ are not uniformly distributed on $[0,1]$, but converge to…
A family of nested recurrence relations $a(n+1) = n - a^{(m)}(n) + a^{(m+1)}(n)$, parameterized by an integer $m \ge 1$ with initial condition $a(1)=1$, is studied. We prove that $a(n)=n-h(n)$ is the unique solution satisfying this…
Roughly speaking, a recurrence relation is nested if it contains a subexpression of the form ... A(...A(...)...). Many nested recurrence relations occur in the literature, and determining their behavior seems to be quite difficult and…
We examine relationships between two minors of order n of some matrices of n rows and n+r columns. This is done through a class of determinants, here called $n$-determinants, the investigation of which is our objective. We prove that…
A nondecreasing sequence of positive integers is $(\alpha,\beta)$-Conolly, or Conolly-like for short, if for every positive integer $m$ the number of times that $m$ occurs in the sequence is $\alpha + \beta r_m$, where $r_m$ is $1$ plus the…
Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).
The Hofstadter Q-sequence is a prominent example of nested recurrence. Despite decades of study, it is not even known whether Q(n) is defined for all n. Mantovanelli introduced a parity-perturbed variant $\widetilde{Q}$, obtained by adding…
Hofstadter's Q-sequence remains an enigma fifty years after its introduction. Initially, the terms of the sequence increase monotonically by 0 or 1 at a time. But, Q(12)=8 while Q(11)=6, and monotonicity fails shortly thereafter. In this…
In this paper we propose a definition of a recurrence relation homomorphism and illustrate our definition with a few examples. We then define the period of a k-th order of linear recurrence relation and deduce certain preliminary results…
We study a perturbed variant of Hofstadter's $Q$-recursion \[ Q(n)=Q(n-Q(n-1))+Q(n-Q(n-2))+(-1)^n, \qquad Q(1)=Q(2)=1 . \] Numerical experiments indicate that the sequence remains well defined for very large values of $n$ and exhibits an…
We compute the divisor of the modular equation on the modular curve $\Gamma_0(N) \backslash \mathbb H^*$ and then find recurrence relations satisfied by the modular traces of the Hauptmodul for any congruence subgroup $\Gamma_0(N)$ of genus…
We describe a recurrence formula for the plethysm $h_3[h_n]$. The proof is based on the original formula by Thrall.
Hofstadter's G function is recursively defined via $G(0)=0$ and then $G(n)=n-G(G(n-1))$. Following Hofstadter, we vary the number $k$ of nested recursive calls in this equation and obtain a family of functions $(F\_k)$. Here we establish…
I propose and investigate the use of continuous functional equations for the study of meta-Fibonacci integer sequences. This exploratory study includes three sequences with quite different behavior: Conway's famous sequence $A(n)=…
In this note, starting with a little-known result of Kuo, I derive a recurrence relation for the Bernoulli numbers $B_{2 n}$, $n$ being any positive integer. This new recurrence seems advantageous in comparison to other known formulae since…