Modularity and the distinct rank function
نویسندگان
چکیده
If R(ω,q) denotes Dyson’s partition rank generating function, due to work of Bringmann and Ono, it is known that for roots of unity ω = 1, R(ω,q) is the “holomorphic part” of a harmonic weak Maass form. Dating back to Ramanujan, it is also known that ̂ R(ω,q) := R(ω,q−1) is given by Eichler integrals and modular forms. In analogy to these results, more recently Monks and Ono have shown that modular forms arise in a natural way from G(ω,q), the generating function for ranks of partitions into distinct parts. Moreover, Monks and Ono pose the following problem: determine whether the function ̂ G(ω,q) :=G(ω,q−1) appears naturally in the theory of modular forms. Here we answer this question of Monks and Ono, and show that ̂ G(ω,q), when combined with ̂ G(ω−1, q) and a twisted third-order mock theta of Ramanujan, form a weight 1 modular form. We provide a more general result on the modularity of certain expressions involving basic hypergeometric series and then show that our result on ̂ G(ω,q) may be deduced from this as a special case.
منابع مشابه
Maximum Maintainability of Complex Systems via Modulation Based on DSM and Module Layout.Case Study:Laser Range Finder
The present paper aims to investigate the effects of modularity and the layout of subsystems and parts of a complex system on its maintainability. For this purpose, four objective functions have been considered simultaneously: I) maximizing the level of accordance between system design and optimum modularity design,II) maximizing the level of accessibility and the maintenance space required,III...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملCOUNTING DISTINCT FUZZY SUBGROUPS OF SOME RANK-3 ABELIAN GROUPS
In this paper we classify fuzzy subgroups of a rank-3 abelian group $G = mathbb{Z}_{p^n} + mathbb{Z}_p + mathbb{Z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. We present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
متن کاملMODULARITY OF AJMAL FOR THE LATTICES OF FUZZY IDEALS OF A RING
In this paper, we construct two fuzzy sets using the notions of level subsets and strong level subsets of a given fuzzy set in a ring R. These fuzzy sets turn out to be identical and provide a universal construction of a fuzzy ideal generated by a given fuzzy set in a ring. Using this construction and employing the technique of strong level subsets, we provide the shortest and direct fuzzy set ...
متن کاملSpectral Graph Forge: Graph Generation Targeting Modularity
Community structure is an important property that captures inhomogeneities common in large networks, and modularity is one of the most widely used metrics for such community structure. In this paper, we introduce a principled methodology, the Spectral Graph Forge, for generating random graphs that preserves community structure from a real network of interest, in terms of modularity. Our approac...
متن کامل