Euler-Type Partition Recurrences

Andrew V. Sills

Euler-Type Partition Recurrences

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

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.

Original language	American English
State	Published - Oct 8 2016
Event	Integers Conference - Duration: Oct 8 2016 → …

Conference

Conference	Integers Conference
Period	10/8/16 → …

Keywords

Euler-Type
Partition Recurrences

DC Disciplines

Mathematics
Physical Sciences and Mathematics

Access to Document

https://drive.google.com/file/d/0ByiXkotHFes3dmhPZk5MZnF0Vms/view

Cite this

@conference{18f96bce01594db7b5e299913299a38b,

title = "Euler-Type Partition Recurrences",

abstract = " Let p(n) denote the number of partitions of the integer n. Recall Euler{\textquoteright}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.",

keywords = "Euler-Type, Partition Recurrences",

author = "Sills, {Andrew V.}",

year = "2016",

month = oct,

day = "8",

language = "American English",

note = "Integers Conference ; Conference date: 08-10-2016",

}

TY - CONF

T1 - Euler-Type Partition Recurrences

AU - Sills, Andrew V.

PY - 2016/10/8

Y1 - 2016/10/8

N2 - 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.

AB - 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.

KW - Euler-Type

KW - Partition Recurrences

UR - https://digitalcommons.georgiasouthern.edu/math-sci-facpres/402

UR - https://drive.google.com/file/d/0ByiXkotHFes3dmhPZk5MZnF0Vms/view

M3 - Presentation

T2 - Integers Conference

Y2 - 8 October 2016

ER -

Euler-Type Partition Recurrences

Abstract

Conference

Keywords

DC Disciplines

Access to Document

Other files and links

Fingerprint

Cite this