Recursion over partitions

DOI10.1134/S2070046614040050zbMATH Open1362.05013OpenAlexW2003867262MaRDI QIDQ2354809FDOQ2354809

Authors: Yanyan Li 

Publication date: 27 July 2015

Published in: \(p\)-Adic Numbers, Ultrametric Analysis, and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s2070046614040050

Recommendations

• scientific article; zbMATH DE number 915321
• The number of partitions of a natural number \(n\) into parts each of which is not less than \(m\)
• scientific article; zbMATH DE number 2108079
• The lattice of integer partitions and its infinite extension
• On the number of partitions into parts of \(k\) different magnitudes

zbMATH Keywords

phylogenetic treepartitionsubpartition

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Elementary theory of partitions (11P81)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Organic mathematics

Cited In (5)

• Recursive method to solve the problem of ``Gambling with God
• Partition Recurrences
• Title not available (Why is that?)
• Partition functions using recursive relations
• Title not available (Why is that?)

Uses Software

• OEIS

This page was built for publication: Recursion over partitions

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