top of page
  • Jesse Sakari Hyttinen

TGA in action! - Jesse Hyttinen

Updated: Apr 20, 2021


As my previous post was a bit short, I make it up to you readers right now. Here is the solution to the brain teaser (list all partitions of the integer 9):

What comes to rooted tree generation, one has to solve the partition equation with setting root vertex and internal vertices as bases and letting other objects act as partition numbers. Here is the process for rooted tree generation when v = 4:

Here is some more added info to the case v = 4:

...And another example, case v = 6:

I also generated the actual graphical presentations:

Here this post ends. In the next post I will continue explaining rooted tree generation with more examples. But before that, a little brain teaser:

Use TGA to generate all rooted rooted trees with v = 5. List the phases in the same manner as in this post. Compare the process with the one of listing all partitions of the integer 4. How do these differ?

I will see you next time!

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