English
Related papers

Related papers: Rank, two-color partitions and Mock theta function

200 papers

We establish two families of congruences modulo powers of 5 for the Fourier coefficients of $(2E_2(2\tau)-E_2(\tau))\eta(2\tau)^{-1}$, where $E_2(\tau)$ is the weight 2 Eisenstein series and $\eta(\tau)$ is the Dedekind eta function. This…

Number Theory · Mathematics 2020-04-21 Liuquan Wang , Yifan Yang

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Combinatorics · Mathematics 2025-07-08 Bruce E Sagan , Sheila Sundaram

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

Combinatorics · Mathematics 2024-11-04 Guy Moshkovitz , Daniel G. Zhu

We improve S.-C. Chen's result on the parity of Schur's partition function. Let $A(n)$ be the number of Schur's partitions of $n$, i.e., the number of partitions of $n$ into distinct parts congruent to $1, 2 \mod{3}$. S.-C. Chen…

Number Theory · Mathematics 2022-11-29 Yiwen Lu , Tao Wei , Xuejun Guo

In this paper we define and study self-similar ranked fragmentations. We first show that any ranked fragmentation is the image of some partition-valued fragmentation, and that there is in fact a one-to-one correspondence between the laws of…

Probability · Mathematics 2007-05-23 Julien Berestycki

We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…

Combinatorics · Mathematics 2014-01-29 Ivica Martinjak , Dragutin Svrtan

The log-rank conjecture is a longstanding open problem with multiple equivalent formulations in complexity theory and mathematics. In its linear-algebraic form, it asserts that the rank and partitioning number of a Boolean matrix are…

Computational Complexity · Computer Science 2026-03-02 Lianna Hambardzumyan , Shachar Lovett , Morgan Shirley

We prove a theorem which add a new member to Rogers-Ramanujan identities. This new member counts partitions with different type of constraints on even and odd parts. Generalizing this theorem, we obtain two family of partition identities of…

Algebraic Geometry · Mathematics 2021-11-11 Pooneh Afsharijoo

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

General Mathematics · Mathematics 2022-12-20 M. J. Kronenburg

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

Combinatorics · Mathematics 2026-05-08 Shlomo Hoory , Dani Kotlar

A hyperbinary partition of the nonnegative integer n is a partition where every part is a power of 2 and every part appears at most twice. We give three applications of the length generating function for such partitions, denoted by h_q(n).…

Combinatorics · Mathematics 2026-03-04 Thomas McConville , James Propp , Bruce E. Sagan

We study $\nu_k(n)$, the number of partitions of $n$ into $k$ part sizes, and find numerous arithmetic progressions where $\nu_2$ and $\nu_3$ take on values divisible by 2 and 4. Expanding earlier work, we show $\nu_2(An+B) \equiv 0…

Combinatorics · Mathematics 2016-05-05 William J. Keith

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…

Number Theory · Mathematics 2025-07-24 Nayandeep Deka Baruah , Subhash Chand Bhoria , Pramod Eyyunni , Bibekananda Maji

Let M be a p-by-q matrix with nonnegative entries. The positive semidefinite rank (psd rank) of M is the smallest integer k for which there exist positive semidefinite matrices $A_i, B_j$ of size $k \times k$ such that $M_{ij} =…

Optimization and Control · Mathematics 2015-09-16 Hamza Fawzi , João Gouveia , Pablo A. Parrilo , Richard Z. Robinson , Rekha R. Thomas

This paper contain results on a strange smallest parts function related to the second Atkin-Garvan moment. Some new identities are discovered in relation to Andrews $spt$ function as well as one of Borweins' two-dimensional theta functions.

Number Theory · Mathematics 2015-07-14 Alexander E. Patkowski

Let Q_K=(Q,<_Q)$ be a strongly K-dense linear order of size K for a suitable cardinal K. We prove, for all integers m > 1 that there is a finite value t_m^+ such that the set of all m-tuples from Q can be divided into t_m^+ many classes,…

Logic · Mathematics 2007-05-23 M. Dzamonja , J. Larson , W. Mitchell

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all…

Number Theory · Mathematics 2020-06-11 Cristina Ballantine , Mircea Merca

We analyze the mock modular behavior of $\bar{P}_\omega(q)$, a partition function introduced by Andrews, Dixit, Schultz, and Yee. This function arose in a study of smallest parts functions related to classical third order mock theta…

Number Theory · Mathematics 2017-09-08 Kathrin Bringmann , Chris Jennings-Shaffer , Karl Mahlburg

This paper is a continuation of our work on theta and zeta functions In the previous papers we considered the case of even dimensional rank one symmetric spaces of non-compact type. The present is concerned with the odd-dimensional case,…

dg-ga · Mathematics 2008-02-03 Ulrich Bunke , Martin Olbrich

Let $M_0(n)$ (resp. $M_1(n)$) denote the number of partitions of $n$ with even (reps. odd) crank. Choi, Kang and Lovejoy established an asymptotic formula for $M_0(n)-M_1(n)$. By utilizing this formula with the explicit bound, we show that…

Combinatorics · Mathematics 2023-10-31 Janet J. W. Dong , Kathy Q. Ji