Euler’s Partition Theorem and Refinements Without Appeal to Infinite Products

DOI10.1007/978-3-030-44559-1_2OpenAlexW3090652739MaRDI QIDQ3387099

Krishnaswami Alladi

Publication date: 12 January 2021

Published in: Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44559-1_2

zbMATH Keywords

partitionsrefinementamalgamation2-modular Ferrers graphsEuler's theoremdistinct partsodd partseven-odd splitseries generating functions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

A new generalization of the minimal excludant arising from an analogue of Franklin's identity

Cites Work

• Unnamed Item
• Unnamed Item
• On partitions with fixed number of even-indexed and odd-indexed odd parts
• Core partitions into distinct parts and an analog of Euler's theorem
• Lecture hall partitions
• A note on partitions into distinct parts and odd parts
• A bijection for Lebesgue's partition identity in the spirit of Sylvester
• Euler's partition theorem for all moduli and new companions to Rogers-Ramanujan-Andrews-Gordon identities
• A NEW COMBINATORIAL STUDY OF THE ROGERS–FINE IDENTITY AND A RELATED PARTIAL THETA SERIES
• ON BASIC HYPERGEOMETRIC SERIES, MOCK THETA FUNCTIONS, AND PARTITIONS (II)

This page was built for publication: Euler’s Partition Theorem and Refinements Without Appeal to Infinite Products