Recursion over partitions

M. Klein*, A. Yu Khrennikov

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


The paper demonstrates how to apply a recursion on the fundamental concept of number. We propose a generalization of the partitions of a positive integer n, by defining new combinatorial objects, namely sub-partitions. A recursive formula is suggested, designated to solve the associated enumeration problem. It is highlighted that sub-partitions provide a good language to study rooted phylogenetic trees.

Original languageEnglish
Pages (from-to)303-309
Number of pages7
JournalP-Adic Numbers, Ultrametric Analysis, and Applications
Issue number4
StatePublished - 1 Oct 2014
Externally publishedYes


  • partition
  • phylogenetic tree
  • sub-partition


Dive into the research topics of 'Recursion over partitions'. Together they form a unique fingerprint.

Cite this