top of page
  • Jesse Sakari Hyttinen

Generating homeomorphically irreducible trees (part 2) - Jesse Hyttinen

Updated: Apr 20, 2021


It seems to me that people prefer tree generation to enumeration, so I will stick to generating homeomorphically irreducible trees with graphical presentations. As I have not generated the graphical presentations for h14 and h15, I will be doing the case h14 now and the case h15 in the next post. This is so important that I have to delay the case h16 for later posts.

Here are the trees for the case h14:

I will see you in the next post!

4 views0 comments

Recent Posts

See All

Skill levels in Treespeak

Examples of Treespeak times, index +1 Novice: Tsm 0-11 --- t >= 10s / rooted tree Apprentice: Tsm 0-11 --- t € [7s ; 10s[ / rooted tree Journeyman: Tsm 0-11 --- t € [5s ; 7s[ / rooted tree Adept: Ts

A new book - Jesse Hyttinen

I have now written five math books, and may write another one in the following year. The current book includes new viewpoints about very well known numbers. Examples include pi and Euler's number. The

Generating r9 part 2 - Jesse Hyttinen

Hi and welcome to the Matladpi blog! We continue the generation process in the column 7: =1+7+1 =1+(1+2+1*4)+1 =1+(1+2*2+1*2)+1 =1+(1+2*3)+1 =1+(1+3+1*3)+1 =1+(1+(1+2)+1*3)+1 =1+(1+3+2+1)+1 =1+(1+(1+2

Post: Blog2_Post
bottom of page