English
Related papers

Related papers: Core Partitions With d-Distinct Parts

200 papers

Let $P$ be the set of integer partitions and $D$ the subset of those with distinct parts. We extend a correspondence of Burge between partitions and binary words to give encodings of both $D$ and $D$ as words over a $k$-ary alphabet, for…

Combinatorics · Mathematics 2024-09-02 John Irving

A well-studied statistic of an integer partition is the size of its Durfee square. In particular, the number $D_k (n)$ of partitions of $n$ with Durfee square of fixed size $k$ has a well-known simple rational generating function. We study…

Combinatorics · Mathematics 2025-07-28 N. Guru Sharan , Armin Straub

Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations…

Number Theory · Mathematics 2021-09-27 Szabolcs Tengely , Maciej Ulas

Using elementary methods, we prove new formulas for $\operatorname{pp}(n)$, the number of plane partitions of $n$, $\operatorname{pp}_r(n)$, the number of plane partitions of $n$ with at most $r$ rows, $\operatorname{pp}^s(n)$, the number…

Combinatorics · Mathematics 2024-05-15 Mircea Cimpoeas , Alexandra Teodor

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

We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Fa\`a di Bruno coefficients. Besides attempting to summarize what is…

Combinatorics · Mathematics 2024-02-13 Robert Coquereaux , Jean-Bernard Zuber

A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…

Computational Geometry · Computer Science 2025-10-23 Orr Dunkelman , Zeev Geyzel , Chaya Keller , Nathan Keller , Eyal Ronen , Adi Shamir , Ran J. Tessler

Let $a_{r,s}(n)$ denote the number of mutlicolored partitions of $n$, wherein both even parts and odd parts may appear in one of $r$-colors and $s$-colors, respectively, for fixed $r,s\ge 1$. The paper aims to study arithmetic properties…

Combinatorics · Mathematics 2026-01-23 M. P. Thejitha , James A. Sellers , S. N. Fathima

The celebrated Rogers-Ramanujan identities equate the number of integer partitions of $n$ ($n\in\mathbb N_0$) with parts congruent to $\pm 1 \pmod{5}$ (respectively $\pm 2 \pmod{5}$) and the number of partitions of $n$ with super-distinct…

Number Theory · Mathematics 2023-03-07 Cristina Ballantine , Amanda Folsom

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

Number Theory · Mathematics 2021-07-01 Rinchin Drema , Nipen Saikia

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

Number Theory · Mathematics 2015-03-17 Mohamed El Bachraoui

We compute partition functions describing multiplicities and charges of massless and first massive string states of pure-spinor superstrings in 3,4,6,10 dimensions. At the massless level we find a spin-one gauge multiplet of minimal…

High Energy Physics - Theory · Physics 2008-11-26 P. A. Grassi , J. F. Morales Morera

Partitions with even (respectively odd) parts distinct and all other parts unrestricted are often referred to as PED (respectively POD) partitions. In this article, we generalize these notions and study sets of partitions in which parts…

Combinatorics · Mathematics 2023-08-14 Cristina Ballantine , Amanda Welch

We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…

Combinatorics · Mathematics 2020-04-29 Wenston J. T. Zang , Jiang Zeng

For $k\geq i\geq 1$, let $B_{k,i}(n)$ denote the number of partitions of $n$ such that part 1 appears at most $i-1$ times, two consecutive integers l and $l+1$ appear at most $k-1$ times and if l and $l+1$ appear exactly $k-1$ times then…

Combinatorics · Mathematics 2012-03-21 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi

Let $d \ge 3$ be an integer. We show that whenever an order-$d$ tensor admits $d+1$ decompositions according to Tao's slice rank, if the linear subspaces spanned by their one-variable functions constitute a sunflower for each choice of…

Combinatorics · Mathematics 2023-08-15 Thomas Karam

Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon…

Combinatorics · Mathematics 2021-10-27 George E. Andrews , Shane Chern , Zhitai Li

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…

Combinatorics · Mathematics 2023-10-30 Y. H. Chen , Thomas Y. He , F. Tang , J. J. Wei

For a given integer $d\ge 1$, we consider $\binom{n+d-1}{d}$-color compositions of a positive integer $\nu$ for which each part of size $n$ admits $\binom{n+d-1}{d}$ colors. We give explicit formulas for the enumeration of such…

Combinatorics · Mathematics 2018-03-22 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Tverberg's theorem states that any set of $t(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Moreover, generic collections of fewer points cannot be so…

Combinatorics · Mathematics 2023-11-10 Steven Simon , Tobias Timofeyev