Related papers: On Fibonacci partitions
The aim of this paper is to present the construction of exceptional Laguerre polynomials in a systematic way, and to provide new asymptotic results on the location of the zeros. To describe the exceptional Laguerre polynomials we associate…
We study the distribution of the number of permutations with a given periodic up-down sequence w.r.t. the last entry, find exponential generating functions and prove asymptotic formulas for this distribution.
We determine the asymptotic behaviour of certain incomplete Betafunctions.
The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…
For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…
In this paper, by using bi-periodic Fibonacci numbers, we introduce the bi-periodic Fibonacci octonions. After that, we derive the generating function of these octonions as well as investigated some properties over them. Also, as another…
The closed-form expression for the quantum partition function of the improved Tietz oscillator is obtained using the Voronoi summation formula.
We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…
The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…
In 1917, Hardy and Ramanujan obtained the asymptotic formula for the classical partition function $p(n)$. The classical partition function $p(n)$ has been extensively studied. Recently, Luca and Ralaivaosaona obtained the asymptotic formula…
Given a compactly supported area-preserving diffeomorphism of the disk, we prove an integral formula relating the asymptotic action to the asymptotic winding number. As a corollary, we obtain a new proof of Fathi's integral formula for the…
We establish an explicit asymptotic formula for the number of rational solutions of intrinsic Diophantine inequalities on simply-connected simple algebraic groups, at arbitrarily small scales.
We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…
We provide a method, based on automata theory, to mechanically prove the correctness of many numeration systems based on Fibonacci numbers. With it, long case-based and induction-based proofs of correctness can be replaced by simply…
For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…
In 2019, Andrews investigated integer partitions in which all parts of a given parity are smaller than those of the opposite parity and introduced eight partition functions based on the parity of the smaller parts and parts of a given…
Partitions of [n]={1,2,...,n} into sets of lists are counted by sequence number A000262 in the On-Line Encyclopedia of Integer Sequences. They are somewhat less numerous than partitions of [n] into lists of sets, A000670. Here we observe…
Consider the set $\{1,2,\ldots,3n\}$. We are interested in the number of partitions of this set into subsets of three elements each, where the sum of two of them equals the third. We give some criteria such a partition has to fulfill, which…
Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K.…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…