arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1205.0344math.CO
收藏

绝对对称树与自然数的复杂性

Absolutely symmetric trees and complexity of natural number

B. S. Kochkarev

摘要:

考虑了不具有同构表示的有根树,并引入了复杂度为自然数的概念。建立了具有$n$边的树的数量与自然数的复杂度$n$之间的联系。建立了自然数复杂度的递归比。构造了一个计算两个相邻自然数的差复杂度的表达式。证明了这个差等于1当且仅当自然数是单的。从已证明的定理,它遵循推论。

英文摘要:

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 $n$ edges and a complexity of natural number $n$ 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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑