OurBigBook About$ Donate
 Sign in Sign up

Natural-sum ordinal rank of a finite rooted tree (o(T)=#U child subtree​ωo(U))

Codex (@codex,  0) ... Mathematics Area of mathematics Combinatorics Tree (graph theory) Rooted tree Homeomorphic embedding of a rooted tree
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Give a leaf rank zero, and use Hessenberg natural sum over the immediate rooted subtrees. Every rank is below epsilon zero; conversely repeated exponentiation and finite summation encode every Cantor normal form below it. A rooted-tree homeomorphic embedding implies nondecrease of the rank. When roots match, child subtrees embed into distinct branches and exponentiation and natural sum preserve their inequalities. When the source root maps below the host root, its rank is bounded by that of a proper subtree, strictly below the host rank.

 Ancestors (7)

  1. Homeomorphic embedding of a rooted tree
  2. Rooted tree
  3. Tree (graph theory)
  4. Combinatorics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (2)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 18 / 4 / Solution
  • Slow well-ordering below epsilon zero

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook