Related papers: On Fibonacci partitions
Let $a(n)$ denote the number of non-isomorphic abelian groups with $n$ elements. In 1991 Ivi\'{c} proved an asymptotic formula of the sum $\sum_{n\leq x} a(n+ a(n)).$ In this paper, we will prove a sharper asymptotic formula for this sum.
We prove an asymptotic formula for the number of $d$-fold partition diamonds of $n$ and their Schmidt-type counterparts. In order to do so, we study the asymptotic behavior of certain infinite products. We also remark on interesting…
The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…
The main result of the paper is the Fibonacci-like property of the partition function. The partition function $p(n)$ has a property: $p(n) \leq p(n-1) + p(n-2)$. Our result shows that if we impose certain restrictions on the partition, then…
In this note we investigate the solutions of certain meta-Fibonacci recurrences of the form $f(n)=f(n-f(n-1))+f(n-2)$ for various sets of initial conditions. In the case when $f(n)=1$ for $n\leq 1$, we prove that the resulting integer…
We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…
Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…
In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.
Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…
We will prove an infinite family of asymptotic formulas for the logarithm of certain two-colored partitions. An infinite sub-family of these asymptotics was posed as a conjecture by Guadalupe.
A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…
This note contains a report of a proof by computer that the Fibonacci group F(2,9) is automatic. The automatic structure can be used to solve the word problem in the group. Furthermore, it can be seen directly from the word-acceptor that…
We conjecture that the asymptotic behavior of the numbers of solid (three-dimensional) partitions is identical to the asymptotics of the three-dimensional MacMahon numbers. Evidence is provided by an exact enumeration of solid partitions of…
We discuss $Q(n)$, the number of ways a given integer $n$ may be written as a sum of distinct primes, and study its asymptotic form $Q_{as}(n)$ valid in the limit $n\to\infty$. We obtain $Q_{as}(n)$ by Laplace inverting the fermionic…
Let $F_n(x)$ be the partition polynomial $\sum_{k=1}^n p_k(n) x^k$ where $p_k(n)$ is the number of partitions of $n$ with $k$ parts. We emphasize the computational experiments using degrees up to $70,000$ to discover the asymptotics of…
We calculate the asymptotic value of the choice number of complete multi-partite graphs.
In this paper we present a new formula for the number of unrestricted partitions of $n$. We do this by introducing a correspondence between the number of unrestrited partitions of $n$ and the number of non-negative solutions of systems of…
For fixed s, the size of an (s, s+1)-core partition with distinct parts can be seen as a random variable X_s. Using computer-assisted methods, we derive formulas for the expectation, variance, and higher moments of X_s. Our results give…
We use the Circle Method to derive asymptotic formulas for functions related to the number of parts of partitions in particular residue classes.
We prove some separation results for the roots of the generalized Fibonacci polynomials and their absolute values