Related papers: On Fibonacci partitions
We prove asymptotic formulas for the complex coefficients of $(\zeta q;q)_\infty^{-1}$, where $\zeta$ is a root of unity, and apply our results to determine secondary terms in the asymptotics for $p(a,b,n)$, the number of integer partitions…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which…
Wilf partitions are partitions of an integer $n$ in which all nonzero multiplicities are distinct. On his webpage, the late Herbert Wilf posed the problem to find "any interesting theorems" about the number f(n) of those partitions.…
The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…
Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated $(s, m s \pm 1)$-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these…
We introduce and study block-separated overpartitions, a constrained family of overpartitions in which no two consecutive distinct part-blocks are both overlined. This local restriction produces a new sequence that naturally interpolates…
We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…
A Turing machine that computes Fibonacci numbers is described.
We describe old and prove new results on properties of the Fibonacci Lie algebra in a self-contained exposition. First, we study the growth of this algebra in more details. So, we show that the polynomial behaviour of the growth function in…
We derive an asymptotic formula for $A(n,j,r)$ the number of integer partitions of $n$ into at most $j$ parts each part $\le r$. We assume $j$ and $r$ are near their mean values. We also investigate the second largest part, the number of…
In this paper, we study partitions of positive integers into distinct quasifibonacci numbers. A digraph and poset structure is constructed on the set of such partitions. Furthermore, we discuss the symmetric and recursive relations between…
We obtain exact asymptotic results for the disorder averaged persistence of a Brownian particle moving in a biased Sinai landscape. We employ a new method that maps the problem of computing the persistence to the problem of finding the…
Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…
The plane partition polynomial $Q_n(x)$ is the polynomial of degree $n$ whose coefficients count the number of plane partitions of $n$ indexed by their trace. Extending classical work of E.M. Wright, we develop the asymptotics of these…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
We develop the basis of the two dimensional generalized quantum statistical systems by using results on $r$-generalized Fibonacci sequences. According to the spin value $s$ of the 2d-quasiparticles, we distinguish four classes of quantum…
We study the asymptotic behaviour of the trace (the sum of the diagonal parts) of a plane partition of the positive integer n, assuming that this parfition is chosen uniformly at random from the set of all such partitions.
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
Certain mathematical structures make a habit of reoccuring in the most diverse list of settings. Some obvious examples exhibiting this intrusive type of behavior include the Fibonacci numbers, the Catalan numbers, the quaternions, and the…