Related papers: Using Periodicity to Obtain Partition Congruences
We extend a holomorphic projection argument of our earlier work to prove a novel divisibility result for non-holomorphic congruences of Hurwitz class numbers. This result allows us to establish Ramanujan-type congruences for Hurwitz class…
Recently, Andrews and Paule studied Schmidt type partitions using MacMahon's Partition Analysis and obtained various interesting results. In this paper, we focus on the combinatorics of Schmidt type partition theorems and characterize them…
In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…
We generalize recent results of Breuer and Kronholm, and Chern on partitions and overpartitions with bounded differences between largest and smallest parts. We prove our generalization both analytically and combinatorially.
Relations involving the Rogers-Ramanujan continued fractions $R(q),$ $R(q^3 ),$ and $R(q^4)$ are used to find new generating functions and congruences modulo 5 and 25 for 3-core, 4-core, 4-regular, and colored partition functions.
Set partitioning is a key component of many algorithms in machine learning, signal processing, and communications. In general, the problem of finding a partition that minimizes a given impurity (loss function) is NP-hard. As such, there…
Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…
Partitioning algorithms play a key role in many scientific and engineering disciplines. A partitioning algorithm divides a set into a number of disjoint subsets or partitions. Often, the quality of the resulted partitions is measured by the…
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the…
We offer some partition functions related to ternary quadratic forms, and note on their upper bounds and related properties. We offer these results as an application of a simple method related to conjugate Bailey pairs presented in a prior…
Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius…
We explore partitions that lie in the intersection of several sets of classical interest: partitions with parts indivisible by $m$, appearing fewer than $m$ times, or differing by less than $m$. We find results on their behavior and…
In combinatorial optimization, partial variable assignments are called persistent if they agree with some optimal solution. We propose persistency criteria for the multicut and max-cut problem as well as fast combinatorial routines to…
Noting a curious link between Andrews' even-odd crank and the Stanley rank, we adopt a combinatorial approach building on the map of conjugation and continue the study of integer partitions with parts separated by parity. Our motivation is…
We study the problem of partitioning a given simple polygon $P$ into a minimum number of connected polygonal pieces, each of bounded size. We describe a general technique for constructing such partitions that works for several notions of…
In this paper we propose a new approach to least squares approximation problems. This approach is based on partitioning and Schur function. The nature of this approach is combinatorial, while most existing approaches are based on algebra…
We study the integration problem on Hilbert spaces of (multivariate) periodic functions. The standard technique to prove lower bounds for the error of quadrature rules uses bump functions and the pigeon hole principle. Recently, several new…
In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…
A cubic partition consists of partition pairs $(\lambda,\mu)$ such that $\vert\lambda\vert+\vert\mu\vert=n$ where $\mu$ involves only even integers but no restriction is placed on $\lambda$. This paper initiates the notion of generalized…
Given a finite collection of two-dimensional tile types, the field of study concerned with covering the plane with tiles of these types exclusively has a long history, having enjoyed great prominence in the last six to seven decades. Much…