A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts

DOI10.37236/8199zbMath1477.11180OpenAlexW3184459927MaRDI QIDQ2048548

Acadia Larsen

Publication date: 6 August 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37236/8199

zbMATH Keywords

partitionslinear combinations of partitions

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Partition identities; identities of Rogers-Ramanujan type (11P84)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins
• A formula for the partition function that ``counts
• Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)
• Bijections and recurrences for integer partitions into a bounded number of parts
• From partition identities to a combinatorial approach to explicit Satake inversion
• Quasipolynomials and maximal coefficients of Gaussian polynomials
• Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts
• On classical groups detected by the triple tensor product and the Littlewood-Richardson semigroup
• On tensor third $L$-functions of automorphic representations of $GL_n(\mathbb {A}_F)$
• Partitions with fixed differences between largest and smallest parts
• PARTITIONS WITH PARTS IN A FINITE SET
• Differences of Partition Functions: The Anti-telescoping Method
• A Simple Proof of a Known Result in Partitions

This page was built for publication: A generalization of partition identities for first differences of partitions of \(n\) into at most \(m\) parts