相关论文: Power Partitions and Semi-m-Fibonacci Partitions

In recent work, M. Just and the second author defined a class of "semi-modular forms" on $\mathbb C$, in analogy with classical modular forms, that are "half modular" in a particular sense; and constructed families of such functions as…

In 2010, Andrews considers a variety of parity questions connected to classical partition identities of Euler, Rogers, Ramanujan and Gordon. As a large part in his paper, Andrews considered the partitions by restricting the parity of…

We present here some new identities for generalizations of Fibonacci and Lucas numbers by combinatorially interpreting these numbers in terms of numbers of certain tilings of a $1 \times m$ board. As a consequence, some new interesting…

Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

An almost self-conjugate (ASC) partition has a Young diagram in which each arm along the diagonal is exactly one box longer than its corresponding leg. Classically, the ASC partitions and their conjugates appear in two of Littlewood's…

Given $m\in \mathbb{N},$ a numerical semigroup with multiplicity $m$ is called packed numerical semigroup if its minimal generating set is included in $\{m,m+1,\ldots, 2m-1\}.$ In this work, packed numerical semigroups are used to built the…

In this paper we introduce a family of partitions of the set of natural numbers, Fibonacci-like partitions. In particular, we introduce a Fibonacci-like partition in a number of parts corresponding to the Fibonacci numbers, the standard…

Recently, Hirschhorn and Sellers defined the partition function $a_r(n)$, which counts the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may appear in one of $r$-colors for fixed $r\ge1$. The aim…

It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

Based on the combinatorial interpretation of the ordered Bell numbers, which count all the ordered partitions of the set $[n]=\{1,2,\dots,n\}$, we introduce the Fibonacci partition as a Fibonacci permutation of its blocks. Then we define…

Recently, George Beck introduced two partition statistics $NT(m,j,n)$ and $M_{\omega}(m,j,n)$, which denote the total number of parts in the partition of $n$ with rank congruent to $m$ modulo $j$ and the total number of ones in the…

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…

In this paper, we find all integers c having at least two representations as a difference between a Fibonacci number and a power of 2.

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 extend recent results by G. E. Andrews and G. Simay on the $m$th largest and $m$th smallest parts of a partition to the more general context of skew plane partitions. In order to do this, we introduce new objects called skew plane…

We prove polynomial boson-fermion identities for the generating function of the number of partitions of $n$ of the form $n=\sum_{j=1}^{L-1} j f_j$, with $f_1\leq i-1$, $f_{L-1} \leq i'-1$ and $f_j+f_{j+1}\leq k$. The bosonic side of the…

A Goellnitz-Gordon partition is one in which the parts differ by at least 2, and where the inequality is strict if a part is even. Let Q_i(n) denote the number of partitions of n into distinct parts not congruent to i mod 4. By attaching…