Mathematical Sciences: Faculty Presentations (1991-2022)

Euler-Type Partition Recurrences

Document Type

Presentation

Presentation Date

10-8-2016

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

Let p(n) denote the number of partitions of the integer n. Recall Euler’s recurrence p(n) - p(n-1) - p(n-2) + p(n-5) + p(n-7) - p(n-12) - p(n-15) + . . . = 0 for all nonzero n. We present some additional Euler-type recurrences for p(n) and other combinatorial functions. Joint work with Yuriy Choliy, Rutgers University.

Sponsorship/Conference/Institution

Integers Conference

Location

Carrollton, GA

This document is currently not available here.

Share

COinS