Skip to content
Preprint

Asymptotics for partitions over the Fibonacci numbers and related sequences, II

Nov 2026 · 0 citations · 16 references
Mathematics

Abstract

In a recent paper of the same title, we considered nondistinct partitions of integers over the Fibonacci sequence and related linearly recurrent sequences. In this paper, continuing this story, we apply the same method, but consider distinct partitions. In particular, let $q_F(m)$ denote the number of ways of writing $m$ as the sum of distinct Fibonacci numbers. It is well-known that, while $q_F(m)$ behaves wildly, its partial sums behave in a more structured way. In particular, Kempton showed that the function $N^{-\log 2/\log\varphi}\sum_{m\leqslant N}q_F(m)$ is asymptotically logarithmically-periodic. In this paper, we improve on this result by providing an explicit error term. Additionally, we prove the analogous result for a class of more general linear recurrent sequences.

View source

Similar papers

Preprint Sep 2026

Congruences for the Andrews--Uncu partition function $\mathcal{EO}_u(n)$

In 2018, Andrews defined and studied the partition function $\mathcal{EO}(n)$, which counts the number of partitions of $n$ where each even part is less than each odd part. Thereafter, Uncu considered a different subset of such partitions, namely those partitions counted by $\mathcal{EO}(n)$ where there are no repeated...

Nayandeep Deka Baruah, Hirakjyoti Das, Manjil P. Saikia et al. · 0 citations
Preprint Sep 2026

A proof of the Baruah--Gogoi conjecture on sums of odd and even overlined parts

Andrews and Dastidar introduced the statistic $\SOME(n)$, defined as the difference between the sum of all odd parts and the sum of all even parts occurring in the partitions of $n$, and investigated its arithmetic properties. Motivated by their work, Baruah and Gogoi defined two analogous statistics for overpartitions...

Eric H. Liu, X.-L. Liu, Olivia X. M. Yao · 0 citations
Preprint Nov 2026

Asymptotics for generalized integer partitions

We study the asymptotic behavior of weighted partition functions $p_f(n)$, defined by the generating function $\prod_{n \geq 1} (1 - q^{n})^{-f(n)}$ with non-negative real weights $f(n)$. We assume that the associated Dirichlet series $D(s) = \sum_{n \geq 1} f(n) n^{-s}$ admits a meromorphic continuation to a half-plan...

Armanzhan Onggarbay, D. Yeliussizov · 0 citations
Preprint Oct 2026

Gaps for PLRS with zero coefficients

Zeckendorf proved that every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. Among its extensions, we focus on Positive Linear Recurrence Sequences (PLRS): fixed depth recurrences with non-negative integral coefficients whose first and last terms are positive: $G_{n+1} = c_1 G_n...

Yin-Xi Chen, Zong-Yun Chen, Brian Hii et al. · 0 citations
Preprint Oct 2026

Resolvent Components of Completely Normal Elements and the Morgan-Mullen Conjecture

We study completely normal elements of $\mathbb{F}_{q^n}$ over $\mathbb{F}_q$, that is, elements that are normal over every intermediate field, through partial Lagrange resolvents. In these coordinates, complete normality splits into independent components, in a way closely related to Hachenberger's decomposition theor...

Florian Hellwig · 0 citations
Preprint Nov 2026

A Quasisymmetric Analogue of the Bruhat Order

We define a quasisymmetric analogue of the Bruhat order on indexed binary forests using the multiplicity-free Monk rule for forest polynomials. For the finite window $\mathcal{P}_n$ of forests supported in $[1,n]$, we construct an explicit partition into saturated chains terminating at the top rank, proving that $\math...

Ryan Bansal · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.