Recursion over partitions |
| |
| Authors: | M. Klein A. Yu. Khrennikov |
| |
| Affiliation: | 1. Department of mathematics, Ohalo College, Katzrin, Israel
2. International Center forMathematical Modeling in Physics, Engineering, Economics, and Cognitive Science, School of Computer Science, Physics and Mathematics Linnaeus University, 35195, Vaxjo, Sweden
|
| |
| Abstract: | 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
