In 2016, Berkovich and Uncu proved that, for all nonnegative integers $i$, $j$, and $n$, the number of strict partitions of $n$ with $i$ odd-indexed odd parts and $j$ even-indexed odd parts equals the number of strict partitions of $n$ with $i$ parts congruent to $1$ modulo $4$ and $j$ parts congruent to $3$ modulo $4$. Their proof used generating functions, and they asked for a combinatorial proof. We answer their question with an explicit bijection, assembled from three classical ingredients: $2$-modular diagrams, an insertion algorithm of Chen, Gao, Ji, and Li, and Glaisher's bijection. AxiomProver autonomously formalized and verified the proof of the main theorem in Lean.
In 2018, Andrews defined and studied the partition function $\mathcal{EO}(n)$, which counts the number of partitions of $n$ where each even part is less than each odd part. Thereafter, Uncu considered a different subset of such partitions, namely those partitions counted by $\mathcal{EO}(n)$ where there are no repeated...
Nayandeep Deka Baruah, Hirakjyoti Das, Manjil P. Saikia et al.· 0 citations
In recent work, Hirschhorn and the second author defined $a_k(n)$ to be the number of partitions of $n$ wherein the even parts come in only one color, while the odd parts may be ``colored''with one of $k$ colors for fixed $k\geq 1$. This function generalizes the classical partition function and has been of significant...
Let $P_n(q)=\prod_{j=1}^n(1-q^{3j-2})(1-q^{3j-1})$. For each $p\in\{4,5,6,7,8\}$, we prove that the coefficients of $P_n(q)^p$ in residue class $0$ modulo $3$ are nonnegative, and that those in residue class $2$, after zero terms are omitted, change sign exactly once, from positive to negative. The residue-$0$ coeffici...
A positive $D(n)$-$m$-tuple is a set $A=\{a_1,\ldots,a_m\}$ of distinct positive integers such that $a_i a_j+n$ is a square for every $i\ne j$. In 2005, Dujella and Luca obtained an absolute bound for the cardinality of a $D(p)$- or $D(-p)$-tuple of positive integers, uniformly in the prime $p$. We extend the underlyin...
In this paper, we study the combinatorial object $\bar{b}^k_{r,s}(n)$ which counts the overcolored partition $k$-tuples wherein both even and odd parts are colored with $r$ and $s$ colors, respectively. We extend results of Chacon and Sellers for several families of $r,s$ and $k$. We also establish divisibility propert...
Let $\mathbb{N}_0=\{0,1,2,\ldots\}$ and let $h\ge2$ be an integer. For a set $A\subseteq\mathbb{N}_0$, write $hA$ for the set of all sums of $h$, not necessarily distinct, elements of $A$. In this paper, we prove that for every $h\ge2$, there is a partition $\mathbb{N}_0=A\sqcup B$ such that $A$ is a minimal asymptotic...
Shi-Qiang Chen· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
