Saved in:
Bibliographic Details
Main Author: Salami, Sajad
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2604.15447
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914481928404992
author Salami, Sajad
author_facet Salami, Sajad
contents Zeckendorf's theorem establishes a unique representation for positive integers as sums of non-consecutive Fibonacci numbers. This result has been generalized to Positive Linear Recurrence Sequences (PLRS), where key statistical properties, such as the Gaussian distribution of summands, depend on strictly positive recurrence coefficients. This paper investigates the consequences of relaxing this condition by studying \textit{Zero Linear Recurrence Relations (ZLRRs)}, where the leading coefficient is zero ($c_1=0$). Focusing on the \textit{Lagonacci sequence} ($Z_{n+1}=Z_{n-1}+Z_{n-2}$) as a primary case study, we demonstrate that while the uniqueness of decompositions is lost, fundamental statistical behaviors persist. We prove that the number of summands in the canonical greedy decomposition converges to a \textit{Gaussian distribution} and that the distribution of gaps between indices decays \textit{geometrically}. Furthermore, we utilize the \textit{principle of equivalence of ensembles} to show these properties are robust for a wide class of ZLRRs. Finally, we quantify the non-uniqueness of these systems, proving that the number of legal decompositions grows \textit{exponentially} at a rate $α=2$, significantly exceeding the growth of the underlying sequence.
format Preprint
id arxiv_https___arxiv_org_abs_2604_15447
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Gaussian Behavior and Geometric Gaps in Decompositions from Recurrences with Zero Coefficients
Salami, Sajad
Number Theory
11B39, 11K65
Zeckendorf's theorem establishes a unique representation for positive integers as sums of non-consecutive Fibonacci numbers. This result has been generalized to Positive Linear Recurrence Sequences (PLRS), where key statistical properties, such as the Gaussian distribution of summands, depend on strictly positive recurrence coefficients. This paper investigates the consequences of relaxing this condition by studying \textit{Zero Linear Recurrence Relations (ZLRRs)}, where the leading coefficient is zero ($c_1=0$). Focusing on the \textit{Lagonacci sequence} ($Z_{n+1}=Z_{n-1}+Z_{n-2}$) as a primary case study, we demonstrate that while the uniqueness of decompositions is lost, fundamental statistical behaviors persist. We prove that the number of summands in the canonical greedy decomposition converges to a \textit{Gaussian distribution} and that the distribution of gaps between indices decays \textit{geometrically}. Furthermore, we utilize the \textit{principle of equivalence of ensembles} to show these properties are robust for a wide class of ZLRRs. Finally, we quantify the non-uniqueness of these systems, proving that the number of legal decompositions grows \textit{exponentially} at a rate $α=2$, significantly exceeding the growth of the underlying sequence.
title Gaussian Behavior and Geometric Gaps in Decompositions from Recurrences with Zero Coefficients
topic Number Theory
11B39, 11K65
url https://arxiv.org/abs/2604.15447