Related papers: Multiplication theorems for self-conjugate partiti…

In 2003, Hammond and Lewis defined a statistic on partitions into 2 colors which combinatorially explains certain well known partition congruences mod 5. We give two analogs of Hammond and Lewis's birank statistic. One analog is in terms of…

Ramanujan's celebrated congruences of the partition function $p(n)$ have inspired a vast amount of results on various partition functions. Kwong's work on periodicity of rational polynomial functions yields a general theorem used to…

Using a specific form of the triple product identity, polygonal number identities are stated. Further number identities are examined that can be considered identities related to modular sets of numbers. The identities can be used to give…

A partition is called an $(s_1,s_2,\dots,s_p)$-core partition if it is simultaneously an $s_i$-core for all $i=1,2,\dots,p$. Simultaneous core partitions have been actively studied in various directions. In particular, researchers concerned…

Recently, Schneider and Schneider defined a new class of partitions called sequentially congruent partitions, in which each part is congruent to the next part modulo its index, and they proved two partition bijections involving these…

Let $\mathcal O_r(n)$ be the set of $r$-regular partitions of $n$, $\mathcal D_r(n)$ the set of partitions of $n$ with parts repeated at most $r-1$ times, $\mathcal O_{1,r}(n)$ the set of partitions with exactly one part (possibly repeated)…

New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Motivated by this result,…

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…

In 2018 Liuquan Wang and Yifan Yang proved the existence of an infinite family of congruences for the smallest parts function corresponding to the third order mock theta function $\omega(q)$. Their proof took the form of an induction…

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…

Multiranks and new rank/crank analogs for a variety of partitions are given, so as to imply combinatorially some arithmetic properties enjoyed by these types of partitions. Our methods are elementary relying entirely on the three classical…

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…

Recently, Nadji, Ahmia and Ram\'{i}rez \cite{Nadji2025} investigate the arithmetic properties of ${\bar B}_{\ell_1,\ell_2}(n)$, the number of overpartitions where no part is divisible by $\ell_1$ or $\ell_2$ with $\gcd(\ell_1,\ell_2)$$=1$…

We extend the classical construction of operator colligations and characteristic functions. Consider the group $G$ of finite block unitary matrices of size $\alpha+\infty+...+\infty$ ($k$ times). Consider the subgroup $K=U(\infty)$, which…

This is an introduction to algebraic combinatorics, written for a quarter-long graduate course. It starts with a rigorous introduction to formal power series with some combinatorial applications, then discusses integer partitions (proving…

A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $\lambda>0$ be an integer. The partition is said to be a $\lambda$--partition if…

Using Jack polynomials, Goulden and Jackson have introduced a one parameter deformation $\tau_b$ of the generating series of bipartite maps, which generalizes the partition function of $\beta$-ensembles of random matrices. The Matching-Jack…

Let k be an algebraically closed field of characteristic p>0 and let G be a symplectic or general linear group over k. We consider induced modules for G under the assumption that p is bigger than the greatest hook length in the partitions…