Related papers: Using Periodicity to Obtain Partition Congruences
We develop the theory of copartitions, which are a generalization of partitions with connections to many classical topics in partition theory, including Rogers-Ramanujan partitions, theta functions, mock theta functions, partitions with…
In this paper we relate the partition function to the max-statistics of random variables. In particular, we provide a novel framework for approximating and bounding the partition function using MAP inference on randomly perturbed models. As…
Inspired by the recent work by Nadji, Ahmia and Ram\'irez, we examined the arithmetic properties of $\bar{B}_{l_1,l_2} (n)$, the number of overpartitions of n whose parts are neither divisible by $l_1$ nor divisible by $l_2$. In particular,…
Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…
Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…
We prove congruences for the number of partition pairs $(\pi_1,\pi_2)$ such that $\pi_1$ is non-empty, $s(\pi_1)\le s(\pi_2)$, and $\ell(\pi_2)< 2s(\pi_1)$ where $s(\pi)$ is the smallest part and $\ell(\pi)$ is the largest part of a…
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…
The regularity lemma of Szemeredi asserts that one can partition every graph into a bounded number of quasi-random bipartite graphs. In some applications however, one would like to have a strong control on how quasi-random these bipartite…
A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…
In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…
Kaur, Rana, and Eyyunni recently defined the mex sequence of a partition and established, by analytic methods, connections to two disparate types of partition-related objects. We make a bijection between partitions with certain mex…
We introduce a new Partition of Unity Method for the numerical homogenization of elliptic partial differential equations with arbitrarily rough coefficients. We do not restrict to a particular ansatz space or the existence of a finite…
In this paper, we introduce a class of $(P, \omega)$-partitions that we call periodic $(P, \omega)$-partitions, then prove that such $(P, \omega)$-partitions satisfy a homogeneous first-order matrix difference equation. After defining an…
We study certain bijection between plane partitions and $\mathbb{N}$-matrices. As applications, we prove a Cauchy-type identity for generalized dual Grothendieck polynomials. We introduce two statistics on plane partitions, whose generating…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called Sylvester waves) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
Inspired by the paper [1] of V. Bergelson, John H.Johnson Jr., J. Moreira, we formulate an abstract version of image partition regularity. To establish the result we have used a variant of first entry condition and for infinite case we…
Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…
Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…
We compute the congruence class modulo 16 of the number of unique path partitions of $n$ (as defined by Olsson), thus generalising previous results by Bessenrodt, Olsson and Sellers [Ann. Combin. 13 (2013), 591-602].