Absolutely symmetric trees and complexity of natural number
Combinatorics
2012-05-03 v1
Abstract
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with edges and a complexity of natural number is established. The recurrent ratio for complexity of a natural number is founded. An expression for calculation of difference complexities of two adjacent natural numbers is constructed. It is proved that this difference equal 1 if and only if a natural number is simple. From proved theorems it follows corollaries.
Keywords
Cite
@article{arxiv.1205.0344,
title = {Absolutely symmetric trees and complexity of natural number},
author = {B. S. Kochkarev},
journal= {arXiv preprint arXiv:1205.0344},
year = {2012}
}