Partitions into k parts

DOI10.1007/BF01451024zbMATH Open0100.27301OpenAlexW2320006267MaRDI QIDQ774170FDOQ774170

Authors: Edward Maitland Wright 

Publication date: 1961

Published in: Mathematische Annalen (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/160835

zbMATH Keywords

partitionsSylvester theorem

Mathematics Subject Classification ID

Elementary theory of partitions (11P81)

Cites Work

• Title not available (Why is that?)
• Über Partitionen

Cited In (9)

• On the number of partitions of \(n\) into \(k\) different parts
• Counting the parts divisible by k in all the partitions of n whose parts have multiplicity less than k
• Partitions with \(k\) crossings
• Partitions into Parts Simultaneously Regular, Distinct, And/or Flat
• Partitions with parts in a finite set
• Title not available (Why is that?)
• Formulæ for the number of partitions of \(n\) into at most \(m\) parts (using the quasi-polynomial ansatz)
• On partitions into at most m parts
• An explicit form of the polynomial part of a restricted partition function

This page was built for publication: Partitions into \(k\) parts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q774170)