Jeremy Lovejoy, Robert Osburn
We prove formulas for the generating functions for M_2-rank differences for partitions without repeated odd parts. These formulas are in terms of modular forms and generalized Lambert series.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
Sum of parts in overpartitions and partitions without repeated odd parts
本文通过经典 theta 函数恒等式，证明了按奇偶性分类的超划分中某些非划线部分和以及无重复奇数部分划分中某些部分和的模 5 和模 7 拉马努金型同余式。
Combinatorial proofs for partitions with repeated smallest part
针对 Andrews 与 El Bachraoui 关于最小部分恰重复 $k$ 次且其余部分不重复的整数分拆恒等式，本文通过构造双射给出组合证明。
On Partition Classes Arising from Parity, Differences, and Repeated Smallest Parts
本文研究了与奇偶性、差值和重复最小部分相关的划分类，推导了相关身份并扩展了欧拉划分定理，同时给出了组合和q-级数的证明。
Combinatorial Interpretations of Cranks of Overpartitions and Partitions without Repeated Odd Parts
本文为过划分的两个剩余曲柄及无重复奇数部分划分的 $M_2$-曲柄提供组合解释，给出无调整权重的新定义，并揭示其与秩统计量和 Ramanujan 十阶伪 theta 函数的联系。
In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the partition identities for the array with odd number of rows w such that the first and the last row consist of odd positive integers -- the partition identities conjectured by S. Capparelli, A. Meurman, A. Primc and the author and related to standard representations of the affine Lie algebra of type $C^{(1)}_\ell$ for $w=2\ell+1$. The conjecture is based on numerical…
Fibonacci numbers can be expressed in terms of multinomial coefficients as sums over integer partitions into odd parts. We use this fact to introduce a family of double inequalities involving the generating function for the number of partitions into odd parts and the generating function for the number of odd divisors.
Recently, Andrews gave a detailed study of partitions with even parts below odd parts in which only the largest even part appears an odd number of times. In this paper, we provide a combinatorial proof of the generating function identity of such partitions. We also have a further investigation on the largest even part. Finally, we give an interesting weighted overpartition generalization.
Hook length biases for self-conjugate partitions and partitions with distinct odd parts
本文建立了自共轭分拆与具有不同奇数部分分拆间的钩长偏置，推导出固定长度钩总数的渐近公式，并解决了相关猜想。
This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating functions for partitions with bounds on the largest part, the number of parts and with a fixed value of BG-rank or with a fixed value of alternating sum of parts. We extend the work of C. Boulet, and as a result, obtain a four-variable generalization of Gaussian binomial coefficients. In addition we provide combinatorial interpretation of the Berkovich-Warnaar id…
Using quasimodular forms with respect to $Γ_0(4)$ we find exact relations between the M2-rank for partitions without repeated odd parts and three residual cranks. From these identities we are able to deduce various congruences mod 3 and 5 between the rank and crank moments. In turn, these congruences give congruences for $M2spt(n)$, the number of occurrences of smallest parts in the partitions of $n$ with smallest part even and without repeated odd parts, and for the higher order analog $M2spt_2(n)$.
By work of Bringmann, Ono, and Rhoades it is known that the generating function of the $M_2$-rank of partitions without repeated odd parts is the so-called holomorphic part of a certain harmonic Maass form. Here we improve the standing of this function as a harmonic Maass form and show more can be done with this function. In particular we show the related harmonic Maass form transforms like the generating function for partitions without repeated odd parts (which is a modular form). We then use these improvements to determine formulas for the rank differences modulo $7$. Additionally we give id…
Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of congruences: for any integers $α\ge 1$ and $n \ge 0$, \[\mathrm{pod}_{-4}\Big({{3}^{α+1}}n+\frac{5\cdot {{3}^{α}}+1}{2}\Big)\equiv 0 \pmod{9}.\] We also establish some internal congruences and some congruences modulo 2, 5 and 8 satisfied by $\mathrm{pod}_{-4}(n)$.
The two-block odd partition function
本文研究二块奇数分拆函数的算术与组合性质，证明其非负性及模3整除性质，揭示了此类分拆函数的算术正则性。
We utilize false theta function results of Nathan Fine to discover three new partition identities involving weights. These relations connect Göllnitz--Gordon type partitions and partitions with distinct odd parts, partitions into distinct parts and ordinary partitions, and partitions with distinct odd parts where the smallest positive integer that is not a part of the partition is odd and ordinary partitions subject to some initial conditions, respectively. Some of our weights involve new partition statistics, one is defined as the number of different odd parts of a partition larger than or eq…
Let $\mathrm{pod}_{-3}(n)$ denote the number of partition triples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-3}(n)$ involving the following infinite family of congruences: for any integers $α\ge 1$ and $n\ge 0$, \[\mathrm{pod}_{-3}\Big({{3}^{2α+2}}n+\frac{23\times {{3}^{2α+1}}+3}{8}\Big)\equiv 0 \pmod{9}.\] We also establish some arithmetic relations between $\mathrm{pod}(n)$ and $\mathrm{pod}_{-3}(n)$, as well as some congruences for $\mathrm{pod}_{-3}(n)$ modulo 7 and 11.
Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ and conjectured that $d_{o}(n)>d_{e}(n)$ for all $n>19$ where $d_{o}(n)$ (resp. $d_{e}(n)$) denote the number of partitions into distinct parts having more odd parts (resp. even parts) than even parts (resp. odd parts). In this paper we provide combinatorial proofs for both the result and the conjecture of Kim, Kim and Lovejoy. In addition, we show that if we restrict the …
We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our formulas for the $M_2$-rank at roots of unity lead to asymptotics for certain combinations of $N2(r,m,n)$ (the number of partitions without repeated odd parts of $n$ with $M_2$-rank congruent to $r$ modulo $m$). This allows us to deduce inequalities among certain combinations of $N2(r,m,n)$. In particular, we resolve a few conjectured inequalities of Mao.
We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these moments. We then deduce inequalities between the corresponding ordinary moments. In particular we prove that the crank moment for overpartitions is always larger than the rank moment for overpartitions; with recent asymptotics this was known to hold for sufficiently large values of n for each fixed k. Lastly we provide higher order spt functions for overpartitions…
In this paper, we give a combinatorial proof of a positivity result of Chern related to Andrews's $\mathcal{EO}^*$-type partitions. This combinatorial proof comes after reframing Chern's result in terms of copartitions. Using this new perspective, we also reprove an overpartition result of Chern by showing that it comes essentially "for free" from our combinatorial proof and some basic properties of copartitions. Finally, the application of copartitions leads us to more general positivity conjectures for families of both infinite and finite products, with a proof in one special case.
Combinatorial Extensions on Andrews and El Bachraoui's Almost-Distinct Partitions
针对Andrews和El Bachraoui提出的最小部分重复、其他部分不同的整数分拆相关恒等式，本文给出其无限族的组合证明，还研究仅最大部分可重复的类似分拆，得到不同部分分拆数的无限族不等式。
Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the excess of the number of parts in all partitions of n into odd parts over the number of parts in all partitions of n into distinct parts equals the number of partitions of n with exactly one even part (possibly repeated). Beck's original conjecture was followed by generalizations and so-called "Beck-type" companions to other identities. In this paper, we establish…
A uniform proof approach for congruences modulo 3 for partitions with $k$-colored odd parts
本文为带$k$色奇数部分的分拆函数$a_k(n)$建立模3同余的统一证明框架，从而证明无限族非嵌套同余。
Recent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between two partition statistics, the crank and the mex. They state that, for a positive integer $n$, there are as many partitions of $n$ with non-negative crank as partitions of $n$ with odd mex. In this paper, we give a bijective proof of a generalization of this identity provided by Hopkins, Sellers, and Stanton. Our method uses an alternative definition of the Durfee decomposition, whose combinatorial link to the crank was recently studied by Hopkins, Sellers, and Yee.
A Family of Congruences Modulo 7 for Partitions with Monochromatic Even Parts and Multi--Colored Odd Parts
本文推广了Amdeberhan和Merca的整数划分函数a(n)，定义了一个无限族，并通过生成函数和q级数恒等式证明了该族函数满足无穷多个模7同余式。
Recently, Hirschhorn and the first author considered the parity of the function $a(n)$ which counts the number of integer partitions of $n$ wherein each part appears with odd multiplicity. They derived an effective characterization of the parity of $a(2m)$ based solely on properties of $m.$ In this note, we quickly reprove their result, and then extend it to an explicit characterization of the parity of $a(n)$ for all $n\not\equiv 7 \pmod{8}.$ We also exhibit some infinite families of congruences modulo 2 which follow from these characterizations. We conclude by discussing the case $n\equiv 7 …
Combinatorial proofs of inequalities involving the number of partitions with parts separated by parity
本文组合证明了具有按奇偶性分离部分的分拆数之间的几个不等式，并证明了 Fu 和 Tang 提出的一个关于部分重数受限分拆的猜想不等式。
Andrews studied a function which appears in Ramanujan's identities. In Ramanujan's "Lost" Notebook, there are several formulas involving this function, but they are not as simple as the identities with other similar shape of functions. Nonetheless, Andrews found out that this function possesses combinatorial information, odd-even partition. In this paper, we provide the asymptotic formula for this combinatorial object. We also study its companion odd-even overpartitions.
Inequalities and asymptotics for hook numbers in restricted partitions
本文研究了受限划分中钩数的渐进行为，通过渐近公式证明了奇数部分划分在平均意义上比不同部分划分有更多钩数。
Elementary Proofs of Two Congruences for Partitions with Odd Parts Repeated at Most Twice
本文通过初等方法证明了关于有奇数部分最多重复两次的划分函数在模2下的两个同余式，解决了Merca提出的经典证明需求。
Multiplicative congruences for Andrews's even parts below odd parts function and related infinite products
本文证明了Andrews的奇部之下偶部分拆函数$\overline{\mathcal{EO}}(n)$及相关无穷乘积模$2^{12}$的乘法同余，核心方法结合了Fricke对合与Newman的半整数权Hecke算子技术。
Arithmetic of 2-regular partitions with distinct odd parts
本文利用生成函数变形和Hecke特征形式理论，研究了具有不同奇数部分的2-正则分拆数 $pod_2(n)$，并得到了其模2和模8的同余式。
Partitions with parity restrictions: a bijective approach
研究具有奇偶限制的整数划分，用双射方法证明相关恒等式，相比生成函数代数操作更简便。
Families of Congruences for Partitions with $k$-colored odd parts
本文研究了具有k种颜色奇数部分的划分的同余性质，发现其能产生无限多个模3的同余族，并提出进一步研究的问题。
We find and prove a class of congruences modulo 4 for Andrews' partition with certain ternary quadratic form. We also discuss distribution of $\overline{\mathcal{EO}}(n)$ and further prove that $\overline{\mathcal{EO}}(n)\equiv0\pmod4$ for almost all $n$. This study was inspired by similar congruences modulo 4 in the work by the second author and Garvan.
Stanley defined a partition function t(n) as the number of partitions $λ$ of n such that the number of odd parts of $λ$ is congruent to the number of odd parts of the conjugate partition $λ'$ modulo 4. We show that t(n) equals the number of partitions of n with an even number of hooks of even length. We derive a closed-form formula for the generating function for the numbers p(n)-t(n). As a consequence, we see that t(n) has the same parity as the ordinary partition function p(n) for any n. A simple combinatorial explanation of this fact is also provided.
Dyadic Structure of the Two-Block Odd Partition Function and Theta-Weighted Congruences for $pod(n)$
本文通过二元结构分解和theta函数求值，解释两块奇数分拆函数a(n)的递推关系，并利用生成函数因式分解建立模任意奇素数的同余式，获得模3、5、13的无限族加权同余。
PED and POD partitions: combinatorial proofs of recurrence relations
本文用组合方法重新证明了PED与POD分拆的多项递推关系、五边形数定理及Beck型恒等式，弥补了此前仅依赖解析证明的不足。
Hook length biases and general linear partition inequalities
该研究对比奇分拆与互异分拆的固定长度钩数量偏差，证明2、3长钩的数量差异并提出一般猜想，同时建立互异分拆数的通用线性不等式，方法横跨解析与组合领域。
Arithmetic Properties of Partitions with 1-colored Even Parts and r-colored Odd Parts
针对Hirschhorn与Sellers定义的偶数部分1色、奇数部分r色的分拆函数$a_r(n)$，本文借助Newman的结论和模形式理论，证明了其若干模3、模5的无限同余族。
Recently, Andrews defined a partition function $\mathcal{EO}(n)$ which counts the number of partitions of $n$ in which every even part is less than each odd part. He also defined a partition function $\overline{\mathcal{EO}}(n)$ which counts the number of partitions of $n$ enumerated by $\mathcal{EO}(n)$ in which only the largest even part appears an odd number of times. Andrews proposed to undertake a more extensive investigation of the properties of $\overline{\mathcal{EO}}(n)$. In this article, we prove infinite families of congruences for $\overline{\mathcal{EO}}(n)$. We next study parity …
We continue our study of a basic but seemingly intractable problem in integer partition theory, namely the conjecture that $p(n)$ is odd exactly $50\%$ of the time. Here, we greatly extend on our previous paper by providing a doubly-indexed, infinite framework of conjectural identities modulo 2, and show how to, in principle, prove each such identity. However, our conjecture remains open in full generality. A striking consequence is that, under suitable existence conditions, if any $t$-multipartition function is odd with positive density and $t\not \equiv 0$ (mod 3), then $p(n)$ is also odd wi…
Arithmetic Properties of Overcolored Odd Partitions
本文研究了过彩色奇数划分计数函数$ar{a}_s(n)$在模2的幂下满足的新类型同余关系，通过生成函数操作、海克 eigenform 理论和 Newman 的结果建立这些关系。
We show that the number of partitions of n with alternating sum k such that the multiplicity of each part is bounded by 2m+1 equals the number of partitions of n with k odd parts such that the multiplicity of each even part is bounded by m. The first proof relies on two formulas with two parameters that are related to the four-parameter formulas of Boulet. We also give a combinatorial proof of this result by using Sylvester's bijection, which implies a stronger partition theorem. For m=0, our result reduces to Bessenrodt's refinement of Euler's Theorem. If the alternating sum and the number of…
The purpose of this note is to introduce a new approach to the study of one of the most basic and seemingly intractable problems in partition theory, namely the conjecture that the partition function $p(n)$ is equidistributed modulo 2. Our main result will relate the densities, say $δ_t$, of the odd values of the $t$-multipartition functions $p_t(n)$, for several integers $t$. In particular, we will show that if $δ_t>0$ for some $t\in \{5,7,11,13,17,19,23,25\}$, then (assuming it exists) $δ_1>0$; that is, $p(n)$ itself is odd with positive density. Notice that, currently, the best unconditiona…
Partition theory abounds with bijections between different types of partitions. One of the most famous partition bijections maps each self-conjugate partition of a positive integer $n$ to a partition of $n$ into distinct odd parts, and vice versa. Here we prove new necessary and sufficient conditions for a self-conjugate partition to be $t$-core, in terms of only the parts of the corresponding partition into distinct odd parts, by proving a new hook length formula. Corollaries of these results include new applications of $t$-core self-conjugate partitions to subsets of the natural numbers, due…
A remark on decay rates of odd partitions: An application of spectral asymptotics of the Neumann--Poincaré operators
本研究借助Neumann--Poincaré算子的谱渐近性质，以该算子为紧线性算子工具，证明了一个与分拆问题相关的、此前仅能通过紧算子特征值渐近行为验证的定理。
Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge 0$, \[\mathrm{pod}(3n+2)\equiv 2{{(-1)}^{n+1}}{{r}_{5}}(8n+5) \pmod{9}, \] and \[\mathrm{pod}(5n+2)\equiv 2{{(-1)}^{n}}{{r}_{3}}(8n+3) \pmod{5}.\] From which we deduce many interesting congruences including the following two infinite families of Ramanujan-type congruences: for $a \in \{11, 19\}$ and any integers $α\ge 1$ and $n \ge 0$, we have \[\mathrm{pod}\B…
In this note, using entirely algebraic or elementary methods, we determine a new asymptotic lower bound for the number of odd values of one of the most important modular functions in number theory, the Klein $j$-function. Namely, we show that the number of integers $n\le x$ such that the Klein $j$-function --- or equivalently, the cubic partition function --- is odd is at least of the order of $$\frac{\sqrt{x} \log \log x}{\log x},$$ for $x$ large. This improves recent results of Berndt-Yee-Zaharescu and Chen-Lin, and approaches significantly the best lower bound currently known for the ordina…
Fixed Perimeter Analogues of Several Partition Results Related to Parity
该研究将奇偶性偏差不等式等分拆相关结果扩展至固定周长场景，推导了两类特殊分拆的递归公式，推广了经典分拆理论的相关结论。
Finite analogs of partition bias related to hook length two and a variant of Sylvester's map
本文研究带最大部分上界的奇划分与不同划分中长度为二的钩子数量的偏差，利用西尔维斯特映射的变体推广已有不等式，并提出并部分证明加权计数的有限偏差猜想。
Partitions wherein the even parts appear in two different colours are known as cubic partitions. Recently, Merca introduced and studied the function $A(n)$, which is defined as the difference between the number of cubic partitions of $n$ into an even number of parts and the number of cubic partitions of $n$ into an odd number of parts. In particular, using Smoot's \textsf{RaduRK} Mathematica package, Merca proved the following congruences by finding the exact generating functions of the respective functions. For all $n\ge0$, \begin{align*}A(9n+5)\equiv 0\pmod 3,\\ A(27n+26)\equiv 0\pmod 3. \en…
Euclidean billiard partitions were recently introduced by Andrews, Dragovic and Radnovic in their study of periodic trajectories of ellipsoidal billiards in the Euclidean space. They are integer partitions into distinct parts such that (E1) adjacent parts are never both odd; (E2) the smallest part is even. By refining the framework of linked partition ideals, we establish a couple of relevant trivariate generating function identities, from which the result of Andrews, Dragovic and Radnovic follows as an immediate consequence.
$p$-numerical semigroup of the sequence of consecutive odd integers
针对两类连续奇数序列，利用有界受限分拆函数的高斯多项式的对称性与单峰性，证明了Komatsu和Pandey提出的两个p-Frobenius问题猜想。
Recently, Andrews, Chan, Kim and Osburn introduced the even strings and the odd strings in the overpartitions. We show that their conjecture $A_k (n) \geq B_k (n)$ holds for large enough positive integers n, where A_k(n) (resp. B_k(n)) is the number of odd (resp. even) strings along the overpartitions of n. We introduce m-strings and show that how this new combinatorial object is related with another positivity conjecture of Andrews, Chan, Kim, and Osburn. Finally, we confirm that the positivity conjecture is also true for large enough integers.
The difference of the sums of odd and even parts of restricted partitions
本文推导了在部分不重复的限制条件下，分拆的奇部和与偶部和之差的生成函数，并给出了模4的同余式。
Congruences for two-color partitions with odd smallest part
本文研究了二色划分中最小奇数部分的同余性质，推导了相关生成函数的闭式表达式，并提出了极限序列的拉马努金型同余关系。
Andrews and Newman introduced the minimal excludant or ``$mex$'' function for an integer partition $π$ of a positive integer $n$, $mex(π)$, as the smallest positive integer that is not a part of $π$. They defined $σmex(n)$ to be the sum of $mex(π)$ taken over all partitions $π$ of $n$. We prove infinite families of congruence and multiplicative formulas for $σmex(n)$. By restricting to the part of $π$, Andrews and Newman also introduced $moex(π)$ to be the smallest odd integer that is not a part of $π$ and $σmoex(n)$ to be the sum of $moex(π)$ taken over all partitions $π$ of $n$. In this arti…
Overpartitions with repeated smallest non-overlined part
本文扩展了 Andrews 和 Bachraoui 关于重复最小部分的划分研究，研究具有最小非重叠部分恰好出现k次且每个重叠部分都比该部分大的划分，证明了这些划分的生成函数可表示为q-Pochhammer 符号的线性组合。
Linear relations for the number of overpartitions into odd parts
本文针对奇部超分拆数$\bar{p}_o(n)$展开研究，给出其三个线性递推关系，并建立了该函数与多类分拆问题的关联，丰富了类拉马努金同余式相关的分拆理论研究内容。
In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results and the different statistics with the crank of a partition. In particular, we prove that the number of partitions into even number of distinct parts whose odd-indexed parts' sum is n is equal to the number of partitions of n with non-negative crank.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。