PreprintCC BY-NC-ND 4.0HAL
Orbit-Length Statistics for a Fibonacci Successor-Complement Map and a Recurrence-Based Generalization
Abstract
We study the orbit lengths of the integer map defined by the strict Fibonacci successor 𝒟(n)=min{Fk:Fk>n} and its complement ℛ(n)=𝒟(n)−n. If $F_{k-1}\le n
Related
- Fibonacci–Lucas Recurrence-Indexed Quaternionic Unitaries: Channel Convergence, Clifford Proximity, and Controlled Entanglement
- Strong failures of club guessing at the successor of a regular cardinal
- Counting Successor-Closed Subsets of Functional Digraphs
- The successor representation in high-risk drinking and alcohol-related contexts
- Retraction of the complement of smooth projective hypersurfaces to an n-dimensional Δ-complex
BibTeX
@misc{basse2026orbitlength,
title = {{Orbit-Length Statistics for a Fibonacci Successor-Complement Map and a Recurrence-Based Generalization}},
author = {Moïse Basse and El Hadji Deme and Mohamed Ben Fraj Ben Maaouia},
howpublished = {HAL},
year = {2026},
month = nov,
url = {https://hal.science/hal-05855838v1},
note = {CC BY-NC-ND 4.0},
}
RIS
TY - UNPB
TI - Orbit-Length Statistics for a Fibonacci Successor-Complement Map and a Recurrence-Based Generalization
AU - Moïse Basse
AU - El Hadji Deme
AU - Mohamed Ben Fraj Ben Maaouia
PY - 2026
DA - 2026/11/07
PB - HAL
UR - https://hal.science/hal-05855838v1
AB - We study the orbit lengths of the integer map defined by the strict Fibonacci successor 𝒟(n)=min{F_k:F_k>n} and its complement ℛ(n)=𝒟(n)−n. If $F_{k-1}\le n
ER -