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

DOI10.37236/8199MaRDI QIDQ2048548zbMATH OpenOpenAlexFDO

Authors A. Larsen

Publication date 6 August 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

linear combinations of partitionspartitions

Mathematics Subject Classification ID

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

Review text

When is \(m\) is a prime power, the author proves that the first differences of partitions into at most \(m\) parts can be expressed as a non-negative linear combination of partitions into at most \(m-1\) parts. The techniques used to prove this result can be applied to determine when partitions with parts from a finite set positive integers \(A\) can be expressed as a non-negative linear combination of partitions with parts from a finite set positive integers \(B\).

Recommendations

• scientific article; zbMATH DE number 4154697
• Partition identities and the coin exchange problem
• PARTITIONS WITH PARTS IN A FINITE SET
• Bounds for the eventual positivity of difference functions of partitions into prime powers
• Decomposition of the integers as a direct sum of two subsets

Cites work

• A formula for the partition function that ``counts
• A polyhedral model of partitions with bounded differences and a bijective proof of a theorem of Andrews, Beck, and Robbins
• A Simple Proof of a Known Result in Partitions
• Bijections and recurrences for integer partitions into a bounded number of parts
• Computation of q-partial fractions
• Differences of partition functions: the anti-telescoping method
• Formulæ for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz)
• From partition identities to a combinatorial approach to explicit Satake inversion
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3163858 (Why is no real title available?)
• scientific article; zbMATH DE number 3491037 (Why is no real title available?)
• On classical groups detected by the triple tensor product and the Littlewood-Richardson semigroup
• On tensor third \(L\)-functions of automorphic representations of \(\mathrm{GL}_n(\mathbb A_F)\)
• Partitions with fixed differences between largest and smallest parts
• PARTITIONS WITH PARTS IN A FINITE SET
• Polyhedral geometry, supercranks, and combinatorial witnesses of congruences for partitions into three parts
• Quasipolynomials and maximal coefficients of Gaussian polynomials

Cited in

(1)

• On the number of partitions into parts with the minimal part k and the minimal difference d

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048548)