Related papers: Some results on the cubic partition

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…

We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.

We show that Ramanujan-type congruences are preserved by the action of the shallow Hecke algebra and provide several structure results for them. We discover a dichotomy between congruences originating in Hecke eigenvalues and congruences on…

We obtain a small improvement of Gallagher's larger sieve and we extend it to higher dimensions. We also obtain two interesting upper bounds for the number of solutions to polynomial congruences.

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 derive recursive and direct formulas for the interweight distribution of an equitable partition of a hypercube. The formulas involve a three-variable generalization of the Krawtchouk polynomials. Keywords: equitable partition; regular…

In this paper, we consider the set of partitions $pend(n)$ which enumerates the number of partitions of $n$ wherein the even parts are not allowed to be distinct. Using a result of Newman, we prove a few infinite families of congruences…

We denote the number of partitions of $n$ wherein the even parts are distinct (and the odd parts are unrestricted) by $ped(n)$. In this paper, we will use generating function manipulations to obtain new congruences for $ped(n)$ modulo $24$.

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math)…

We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.

For any positive integers $n$ and $r$, let $p_r(n)$ denotes the number of partitions of $n$ where each part has $r$ distinct colours. Many authors studied the partition function $p_r(n)$ for particular values of $r$. In this paper, we prove…

Motivated by Andrews' partitions with initial repetitions, we derive parity formulas for several functions for this class of partitions. In many cases, we present an infinite family of Ramanujan-like congruences modulo 2.

We provide several new $q$-congruences for truncated basic hypergeometric series, mostly of arbitrary order. Our results include congruences modulo the square or the cube of a cyclotomic polynomial, and in some instances, parametric…

We develop a heuristic for the density of integer points on affine cubic surfaces. Our heuristic applies to smooth surfaces defined by cubic polynomials that are log K3, but it can also be adjusted to handle singular cubic surfaces. We…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

We give new bounds and asymptotic estimates for Kronecker and Littlewood--Richardson coefficients. Notably, we resolve Stanley's questions on the shape of partitions attaining the largest Kronecker and Littlewood--Richardson coefficients.…

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…

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

We present lower estimates for the best constant appearing in the weak $(1,1)$ maximal inequality in the space $(\R^n,\|\cdot\|_{\iy})$. We show that this constant grows to infinity faster than $(\log n)^{1-o(1)}$ when $n$ tends to…