English
Related papers

Related papers: Goellnitz-Gordon partitions with weights and parit…

200 papers

Let \pi be a partition. In [2] we defined BG-rank(\pi) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a…

Combinatorics · Mathematics 2007-05-23 Alexander Berkovich , Frank G. Garvan

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

General Mathematics · Mathematics 2023-04-04 Zsófia Juhász , Máté Bartalos , Péter Magyar , Gábor Farkas

For each $s\in\{2,4\}$, the generating function of $R_s(n)$, the number of partitions of $n$ into odd parts or congruent to $0$, $\pm s\pmod {10}$, arises naturally in regime III of Rodney Baxter's solution of the hard-hexagon model of…

Number Theory · Mathematics 2020-06-03 Mircea Merca

Let $a_k(n)$ denote the number of partitions of $n$ wherein even parts come in only one color, while the odd parts may be ``colored" with one of $k$ colors, for fixed $k$. In this note, we find some congruences for $a_k(n)$ in the spirit of…

Number Theory · Mathematics 2026-01-21 Anjelin Mariya Johnson , James A. Sellers , S. N. Fathima

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

Number Theory · Mathematics 2016-05-10 George E. Andrews , Matthias Beck , Neville Robbins

Let $G=(V,E)$ be a simple undirected graph with $n$ vertices then a set partition $\pi=\{V_1, ..., V_k\}$ of the vertex set of $G$ is a connected set partition if each subgraph $G[V_j]$ induced by the blocks $V_j$ of $\pi$ is connected for…

Combinatorics · Mathematics 2015-03-17 Frank Simon , Peter Tittmann , Martin Trinks

Ramanujan's celebrated partition congruences modulo $\ell\in \{5, 7, 11\}$ assert that $$ p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, $$ where $0<\delta_{\ell}<\ell$ satisfies $24\delta_{\ell}\equiv 1\pmod{\ell}.$ By proving Subbarao's…

Number Theory · Mathematics 2024-03-19 Michael Griffin , Ken Ono

A partition of $n$ is $l$-regular if none of its parts is divisible by $l$. Let $b_l(n)$ denote the number of $l$-regular partitions of $n$. In this paper, using theta function identities due to Ramanujan, we establish some new infinite…

Number Theory · Mathematics 2019-07-23 S. Abinash , T. Kathiravan , K. Srilakshmi

This paper has two main parts. Firstly, we give a classification of the $\ell$-blocks of finite special linear and unitary groups $SL_n(\epsilon q)$ in the non-defining characteristic $\ell\ge 3$. Secondly, we describe how the…

Representation Theory · Mathematics 2019-01-18 Zhicheng Feng

An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…

General Mathematics · Mathematics 2007-05-23 Max S. C. Woon

For $l,n \in \mathbb{N}$ we define tonal partition algebra $P^l_n$ over $\mathbb{Z}[\delta]$. We construct modules $\{ \Delta_{\underline{\mu}} \}_{\underline{\mu}}$ for $P^l_n$ over $\mathbb{Z}[\delta]$, and hence over any integral domain…

Representation Theory · Mathematics 2019-12-05 Chwas Ahmed , Paul Martin , Volodymyr Mazorchuk

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Number Theory · Mathematics 2025-09-29 A. David Christopher

Let $A_k(n)$ denote the set of $k$-distinct partitions of $n$, and let $B_k(n)$ be the set of $k$-regular partitions of $n$. Glaisher showed that $\# A_k(n) = \# B_k(n)$. For $k=2$, this equality yields the celebrated Euler's partition…

Combinatorics · Mathematics 2025-11-19 Hongshu Lin , Wenston J. T. Zang

Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…

Group Theory · Mathematics 2017-05-22 A. R. Ashrafi , E. Haghi

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…

We look at the rank generating function $G_\lambda$ of partitions inside the Ferrers diagram of some partition $\lambda$, investigated by Stanton in 1990, as well as a closely related problem investigated by Stanley and Zanello in 2013. We…

Combinatorics · Mathematics 2017-10-03 Samuel Zbarsky

We study a generalized class of weighted $k$-regular partitions defined by \[ \sum_{n=0}^{\infty} c_{k, r_1, r_2}(n) q^n = \prod_{n=1}^{\infty} \frac{(1 - q^{nk})^{r_1}}{(1 - q^n)^{r_2}}, \] which extends the classical $k$-regular partition…

Number Theory · Mathematics 2025-12-05 Debika Banerjee , Ben Kane

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…

Combinatorics · Mathematics 2022-02-08 Cristina Ballantine , Hannah E. Burson , Amanda Folsom , Chi-Yun Hsu , Isabella Negrini , Boya Wen

Using geometric methods and without invoking deep results from group theory, we prove that a classical unital of even order $n\geq4$ is characterized by two conditions (I) and (II): (I) is the absence of O'Nan configurations of four…

Symplectic Geometry · Mathematics 2016-03-25 Alice M. W. Hui

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

Number Theory · Mathematics 2020-06-09 Maxwell Schneider , Robert Schneider