English
Related papers

Related papers: Marking and shifting a part in partition theorems

200 papers

We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…

Combinatorics · Mathematics 2021-03-05 Hartosh Singh Bal , Gaurav Bhatnagar

A gauge invariant partition function is defined for gauge theories which leads to the standard quantization. It is shown that the descent equations and consequently the consistent anomalies and Schwinger terms can be extracted from this…

High Energy Physics - Theory · Physics 2015-05-27 Amir Abbass Varshovi

In a recent paper, Amini et al. introduce a general framework to prove duality theorems between special decompositions and their dual combinatorial object. They thus unify all known ad-hoc proofs in one single theorem. While this…

Discrete Mathematics · Computer Science 2009-10-20 Laurent Lyaudet , Frédéric Mazoit , Stephan Thomasse

The study of the well-known partition function $p(n)$ counting the number of solutions to $n = a_{1} + \dots + a_{\ell}$ with integers $1 \leq a_{1} \leq \dots \leq a_{\ell}$ has a long history in combinatorics. In this paper, we study a…

Number Theory · Mathematics 2024-01-05 Gabriel F. Lipnik , Manfred G. Madritsch , Robert F. Tichy

Inspired by Andrews' 2-colored generalized Frobenius partitions, we consider certain weighted 7-colored partition functions and establish some interesting Ramanujan-type identities and congruences. Moreover, we provide combinatorial…

Combinatorics · Mathematics 2017-11-29 Shane Chern , Dazhao Tang

Given an undirected graph representing similarities between a set of items and an additive measure evaluating the items, we treat the position of a special subset of items in an ordinal ranking through a collection of combinatorial…

Data Structures and Algorithms · Computer Science 2026-05-05 Samuel Boardman

Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…

Functional Analysis · Mathematics 2013-08-27 Ole Christensen , Hong Oh Kim , Rae Young Kim

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

A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…

Combinatorics · Mathematics 2013-12-04 Andrew V. Sills

For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…

Combinatorics · Mathematics 2022-12-29 Darlison Nyirenda

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

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

Extending the notion of $r$-(class) regular partitions, we define $(r_{1},...,r_{m})$-class regular partitions. A partition identity is presented and described by making use of the Glaisher correspondence.

Combinatorics · Mathematics 2015-03-31 Hiroshi Mizukawa , Hiro-Fumi Yamada

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

In this paper, we use the particle motion bijection introduced by Warnaar and developed by the two authors, Jouhet and Konan, to study q-series and partition identities of the Andrews--Gordon type with parity restrictions. These…

Combinatorics · Mathematics 2026-03-06 Jehanne Dousse , Jihyeug Jang

Recently, $4$-regular partitions into distinct parts are connected with a family of overpartitions. In this paper, we provide a uniform extension of two relations due to Andrews for the two types of partitions. Such an extension is made…

Combinatorics · Mathematics 2023-01-27 George E. Andrews , Shane Chern

In a recent paper, we generalized a partition identity stated by Siladi\'c in his study of the level one standard module of type $A_2^{(2)}$. The proof used weighted words with an arbitrary number of primary colors and all the secondary…

Combinatorics · Mathematics 2021-05-21 Isaac Konan

We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified…

Combinatorics · Mathematics 2019-02-21 Kağan Kurşungöz

New splitting theorems in a semi-Riemannian manifold which admits an irrotational vector field (not necessarily a gradient) with some suitable properties are obtained. According to the extras hypothesis assumed on the vector field, we can…

Differential Geometry · Mathematics 2007-05-23 Manuel Gutierrez , Benjamin Olea

The generating function of partitions with repeated (resp. distinct) parts such that each odd part is less than twice the smallest part is shown to be the third order mock theta function $\omega(q)$ (resp. $\nu(-q)$). Similar results for…

Number Theory · Mathematics 2015-03-16 George E. Andrews , Atul Dixit , Ae Ja Yee