2000 character limit reached
On the ordinary and signed Göllnitz--Gordon partitions
Published 18 Dec 2018 in math.CO | (1812.07550v1)
Abstract: Dedicated to George E. Andrews on the occasion of his 70th birthday. Submitted to a special issue for this occasion. We use Andrews' notion of a `signed partition' (i.e. partition where some parts are allowed to be negative) to interpret the G\"ollnitz--Gordon sum, and then provide a bijective map between these signed partitions and the usual G\"ollnitz--Gordon partitions (partitions with difference at least two between parts, and no consecutive even parts).
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.