中文
相关论文

相关论文: Elementary Proofs of Arithmetic Properties for Sch…

200 篇论文

Let $f(q)$ denote Ramanujan's mock theta function \[f(q) = \sum_{n=0}^{\infty} a(n) q^{n} := 1+\sum_{n=1}^{\infty} \frac{q^{n^{2}}}{(1+q)^{2}(1+q^{2})^{2}\cdots(1+q^{n})^{2}}.\] It is known that there are many linear congruences for the…

数论 · 数学 2015-04-15 Nickolas Andersen

The famous Rogers-Ramanujan and Andrews--Gordon identities are embedded in a doubly-infinite family of Rogers-Ramanujan-type identities labelled by positive integers m and n. For fixed m and n the product side corresponds to a specialised…

组合数学 · 数学 2013-11-06 S. Ole Warnaar

We study the divisibility properties of the partition function associated with the eighth order mock theta function $V_0(q)$, introduced by Gordon and McIntosh. We obtain congruences modulo powers of 2 for certain coefficients of the…

数论 · 数学 2020-01-01 B. Hemanthkumar

In this paper, we investigate the combinatorial properties of three classes of integer partitions: (1) $s$-modular partitions, a class consisting of partitions into parts with a number of occurrences (i.e., multiplicity) congruent to $0$ or…

组合数学 · 数学 2024-09-05 Mohammed L. Nadji , Ahmia Moussa

While examples of Ramanujan-type congruences are amply available via their relation to Hecke operators, it remains unclear which of them should be considered of combinatorial origin and which of them are mere artifacts of the connection…

数论 · 数学 2024-04-04 Martin Raum

In 2014, as part of a larger study of overpartitions with restrictions of the overlined parts based on residue classes, Munagi and Sellers defined $d_2(n)$ as the number of overpartitions of weight $n$ wherein only even parts can be…

组合数学 · 数学 2024-12-25 Aidan Carlson , Brian Hopkins , James A. Sellers

The arithmetic properties of the second order mock theta function $\mathcal{B}(q)$, introduced by McIntosh, defined by \begin{equation*} \mathcal{B}(q) := \sum_{n \geq 0} \frac{q^n (-q;q^2)_n}{(q;q^2)_{n+1}} = \sum_{n \geq 0}b(n)q^n,…

数论 · 数学 2025-09-26 Hemjyoti Nath , Hirakjyoti Das

Amdeberhan and Merca recently studied arithmetic properties of the sequence $a(n)$, the reciprocal of the crank parity function, which counts the number of integer partitions of weight $n$ whose even parts are monochromatic and whose odd…

组合数学 · 数学 2025-12-29 Dandan Chen

In this paper we introduce a class of sequences connected with the $m$--ary partition function and investigate their congruence properties. In particular, we get facts about the sequences of $m$--ary partitions $(b_{m}(n))_{m\in\mathbb{N}}$…

数论 · 数学 2017-10-13 Błażej Żmija

Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews,…

数论 · 数学 2014-12-12 Frank Garvan , Chris Jennings-Shaffer

The rank of partitions play an important role in the combinatorial interpretations of several Ramanujan's famous congruence formulas. In 2005 and 2008, the $D$-rank and $M_2$-rank of an overpartition were introduced by Lovejoy,…

组合数学 · 数学 2019-03-06 Huan Xiong , Wenston J. T. Zang

In his striking 1995 paper, Borcherds found an infinite product expansion for certain modular forms with CM divisors. In particular, this applies to the Hilbert class polynomial of discriminant $-d$ evaluated at the modular $j$-function.…

数论 · 数学 2014-07-07 Keenan Monks , Sarah Peluse , Lynnelle Ye

The 2-color partitions may be considered as an extension of regular partitions of a natural number $n$, with $p_{k}(n)$ defined as the number of 2-colored partitions of $n$ where one of the 2 colors appears only in parts that are multiples…

数论 · 数学 2018-01-30 Suparno Ghoshal , Sourav Sen Gupta

We consider a class of generating functions analogous to the generating function of the partition function and establish a bound on the primes $\ell$ for which their coefficients $c(n)$ obey congruences of the form $c(\ell n + a) \equiv 0…

数论 · 数学 2009-04-24 Jonah Sinick

We establish a new bridge between propositional logic and elementary number theory. The main objects are "minimally unsatisfiable clause-sets", short "MUs", unsatisfiable conjunctive normal forms rendered satisfiable by elimination of any…

离散数学 · 计算机科学 2015-07-09 Oliver Kullmann , Xishun Zhao

Let $k\geq 2$ be an integer and $j$ an integer satisfying $1\leq j \leq 4k-5$. We define a family $\{ C_{j,k}(z) \}_{1\leq j \leq 4k-5} $ of eta quotients, and prove that this family constitute a basis for the space $S_{2k} (\Gamma_0 (12))$…

数论 · 数学 2016-04-15 Ayse Alaca , Saban Alaca , Zafer Selcuk Aygin

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

数论 · 数学 2022-07-20 Scott Ahlgren , Patrick B. Allen , Shiang Tang

Recently, Chan and Wang (Fractional powers of the generating function for the partition function. Acta Arith. 187(1), 59--80 (2019)) studied the fractional powers of the generating function for the partition function and found several…

数论 · 数学 2021-09-07 Nayandeep Deka Baruah , Hirakjyoti Das

In this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number $n$ equals the number of partitions of $n$ into distinct parts with two colors. As a consequence, we find…

Recently, Andrews and Paule introduced a partition function $PDN1(N)$ which denotes the number of partition diamonds with $(n+1)$ copies of $n$ where summing the parts at the links gives $N$. They also presented the generating function for…

数论 · 数学 2025-03-04 Julia Q. D. Du , Olivia X. M. Yao