Recursion over partitions

M. Klein; A. Yu Khrennikov

doi:10.1134/S2070046614040050

Recursion over partitions

M. Klein^*, A. Yu Khrennikov

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	303-309
Number of pages	7
Journal	P-Adic Numbers, Ultrametric Analysis, and Applications
Volume	6
Issue number	4
DOIs	https://doi.org/10.1134/S2070046614040050
State	Published - 1 Oct 2014
Externally published	Yes

Keywords

partition
phylogenetic tree
sub-partition

Access to Document

10.1134/S2070046614040050

Cite this

@article{76f4e4a841ce4168995f2ec42b1c249b,

title = "Recursion over partitions",

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 = "partition, phylogenetic tree, sub-partition",

author = "M. Klein and Khrennikov, {A. Yu}",

note = "Publisher Copyright: {\textcopyright} 2014, Pleiades Publishing, Ltd.",

year = "2014",

month = oct,

day = "1",

doi = "10.1134/S2070046614040050",

language = "אנגלית",

volume = "6",

pages = "303--309",

journal = "P-Adic Numbers, Ultrametric Analysis, and Applications",

issn = "2070-0466",

publisher = "Pleiades Publishing",

number = "4",

}

TY - JOUR

T1 - Recursion over partitions

AU - Klein, M.

AU - Khrennikov, A. Yu

PY - 2014/10/1

Y1 - 2014/10/1

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

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

KW - partition

KW - phylogenetic tree

KW - sub-partition

UR - http://www.scopus.com/inward/record.url?scp=84946181142&partnerID=8YFLogxK

U2 - 10.1134/S2070046614040050

DO - 10.1134/S2070046614040050

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84946181142

SN - 2070-0466

VL - 6

SP - 303

EP - 309

JO - P-Adic Numbers, Ultrametric Analysis, and Applications

JF - P-Adic Numbers, Ultrametric Analysis, and Applications

IS - 4

ER -

Recursion over partitions

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this