Related papers: Congruences in fractional partition functions
Using the relationship between Siegel cusp forms of degree $2$ and cuspidal automorphic representations of $\mathrm{GSp}(4,\mathbb{A}_{\mathbb{Q}})$, we derive some congruences involving dimensions of spaces of Siegel cusp forms of degree…
Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…
Recently, Alanazi, Munagi, and Saikia employed the theory of modular forms to investigate the arithmetic properties of the function $\overline{R_{\ell,\mu}}(n)$, which enumerates the overpartitions of $n$ where no part is divisible by…
Andrews' $(k, i)$-singular overpartition function $\overline{C}_{k, i}(n)$ counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined. In recent times, divisibility…
Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…
In 1919, Ramanujan discovered his famous congruences for the partition function. Not too long after, Freeman Dyson conjectured a combinatorial statistic existed that explained the three congruences, which he dubbed the \textit{crank}. A…
Let $\spt(n)$ be the number of smallest parts in the partitions of $n$. In this paper, we give some generalized Euler-like recursive formulas for the $\spt$ function in terms of Hecke trace of values of special twisted quadratic Dirichlet…
In 2002, Andrews, Lewis, and Lovejoy introduced the combinatorial objects which they called {\it partitions with designated summands}. These are built by taking unrestricted integer partitions and designating exactly one of each occurrence…
We determine the action of the Hecke operators \(T_{\mathfrak{p},i}\) on the coefficient forms \(g_{1}, \dots, g_{r-1}, g_{r} = \Delta\), and \(h\), which together generate the ring of modular forms for \(\mathrm{GL}(r,…
It is well known that Ramanujan conjectured congruences modulo powers of $5$, $7$ and and $11$ for the partition function. These were subsequently proved by Watson (1938) and Atkin (1967). In 2009 Choi, Kang, and Lovejoy proved congruences…
We present Euler-type recurrence relations for some partition functions. Some of our results provide new recurrences for the number of unrestricted partitions of $n$, denote by $p(n)$. Others establish recurrences for partition functions…
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 a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
We find the number of partitions of $n$ whose BG-rank is $j$, in terms of $pp(n)$, the number of pairs of partitions whose total number of cells is $n$, giving both bijective and generating function proofs. Next we find congruences mod 5…
Let $NT(m, k, n)$ denote the total number of parts in the partitions of n with rank congruent to m modulo k. Andrews proved Beck's conjecture on congruences for $NT(m, k, n)$ modulo 5 and 7. Generalizing Andrews'results, Chern obtain…
We obtain identities and relationships between the modular $j$-function, the generating functions for the classical partition function and the Andrews $spt$-function, and two functions related to unimodal sequences and a new partition…
We investigate when the clone of congruence preserving functions is finitely generated. We obtain a full description for all finite $p$-groups, and for all finite algebras with Mal'cev term and simple congruence lattice. The…
Recently, using modular forms and Smoot's {\tt Mathematica} implementation of Radu's algorithm for proving partition congruences, Merca proved the following two congruences: For all $n\geq 0,$ \begin{align*} A(9n+5) & \equiv 0 \pmod{3}, \\…
We present some Euler-type recurrences for the partition function $p(n)$.
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…