English
Related papers

Related papers: Shifted and Shiftless Partition Identities II

200 papers

Given a sequence $s=(s_1,s_2,\ldots)$ of positive integers, the inversion sequences with respect to $s$, or $s$-inversion sequences, were introduced by Savage and Schuster in their study of lecture hall polytopes. A sequence…

Combinatorics · Mathematics 2013-10-22 William Y. C. Chen , Alan J. X. Guo , Peter L. Guo , Harry H. Y. Huang , Thomas Y. H. Liu

An integer partition of a positive integer $n$ is called to be $t$-core if none of its hook lengths are divisible by $t$. Recently, Gireesh, Ray and Shivashankar [`A new analogue of $t$-core partitions', \textit{Acta Arith.} \textbf{199}…

Number Theory · Mathematics 2024-05-01 Pranjal Talukdar

Let $\Omega=\{1,2,...,n\}$ where $n \ge 2$. The {\em shape} of an ordered set partition $P=(P_1,..., P_k)$ of $\Omega$ is the integer partition $\lambda=(\lambda_1,...,\lambda_k)$ defined by $\lambda_i = |P_i|$. Let G be a group of…

Group Theory · Mathematics 2007-05-23 William J. Martin , Bruce E. Sagan

Andrews and Newman introduced the mex-function $\text{mex}_{A,a}(\lambda)$ for an integer partition $\lambda$ of a positive integer $n$ as the smallest positive integer congruent to $a$ modulo $A$ that is not a part of $\lambda$. They then…

Number Theory · Mathematics 2023-03-08 Subhrajyoti Bhattacharyya , Rupam Barman , Ajit Singh , Apu Kumar Saha

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…

Combinatorics · Mathematics 2024-09-05 Mohammed L. Nadji , Ahmia Moussa

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Combinatorics · Mathematics 2015-12-15 Clifford Smyth

Let q be an odd positive integer and P \in F2[z] be of order q and such that P(0) = 1. We denote by A = A(P) the unique set of positive integers satisfying \sum_{n=0}^\infty p(A, n) z^n \equiv P(z) (mod 2), where p(A,n) is the number of…

Number Theory · Mathematics 2012-05-08 Fethi Ben Said , Jean-Louis Nicolas

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

In the present paper we initiate the study of a certain kind of partition inequality, by showing, for example, that if $M\geq 5$ is an integer and the integers $a$ and $b$ are relatively prime to $M$ and satisfy $1\leq a<b<M/2$, and the…

Number Theory · Mathematics 2019-01-09 James Mc Laughlin

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. By considering the deviation \begin{equation*} D(a,M) := \sum_{n= 0}^{\infty}\left(N(a,M;n) -…

Number Theory · Mathematics 2018-08-01 Eric T. Mortenson

Recently, Pankaj Jyoti Mahanta and Manjil P. Saikika proved some identities relating certain restricted partitions into distinct odd parts with the partition whose odd parts are distinct combinatorially. They asked for the q-series proofs.…

Combinatorics · Mathematics 2025-04-29 Yong-Chao Shen

Biases in integer partitions have been studied recently. For three disjoint subsets $R,S,I$ of positive integers, let $p_{RSI}(n)$ be the number of partitions of $n$ with parts from $R\cup S\cup I$ and $p_{R>S,I}(n)$ be the number of such…

Combinatorics · Mathematics 2025-09-24 Jiyou Li , Sicheng Zhao

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

For a positive integer $t \geq 2$, the $t$-core of a partition plays an important role in modular representation theory and combinatorics. We initiate the study of $t$-cores of partitions contained in an $r \times s$ rectangle. Our main…

Combinatorics · Mathematics 2024-04-30 Arvind Ayyer , Shubham Sinha

We utilize false theta function results of Nathan Fine to discover three new partition identities involving weights. These relations connect G\"ollnitz--Gordon type partitions and partitions with distinct odd parts, partitions into distinct…

Combinatorics · Mathematics 2016-11-09 Alexander Berkovich , Ali Kemal Uncu

Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…

Combinatorics · Mathematics 2018-09-11 Kathleen O'Hara , Dennis Stanton

We discuss a new companion to Capparelli's identities. Capparelli's identities for m=1,2 state that the number of partitions of $n$ into distinct parts not congruent to m, -m modulo $6$ is equal to the number of partitions of n into…

Combinatorics · Mathematics 2015-06-15 Alexander Berkovich , Ali Kemal Uncu

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner

In a work of 1995, Alladi, Andrews, and Gordon provided a generalization of the two Capparelli identities involving certain classes of integer partitions. Inspired by that contribution, in particular as regards the general setting and the…

Number Theory · Mathematics 2020-04-07 Stefano Capparelli , Alberto Del Fra , Pietro Mercuri , Andrea Vietri

We propose a method to construct a variety of partition identities at once. The main application is an all-moduli generalization of some of Andrews' results in [5]. The novelty is that the method constructs solutions to functional equations…

Combinatorics · Mathematics 2013-02-28 Kağan Kurşungöz