vix.ing · top · new · best · stats · spec

A generalisation of a partition theorem of Andrews to overpartitions

2014/05/01 by Jehanne Dousse, Dousse, Jehanne · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #Mathematical functions and polynomials #Number Theory (math.NT) #math.CO #math.NT

paper · pdf · doi:10.48550/arxiv.1405.0255

arxiv created 2014/05/01 · openalex publication_date 2014/05/01 · arxiv updated 2014/05/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and recurrences.

Cited by

Related