In this thesis, we will define the topswop forest and study the properties of the forest. We will show the number of trees and leaves in the forest. We will also do an experiment to show there is more than an exponential growth between the number of nodes of each tree and the number of elements in the permutation. The experiment also shows that the tallest tree doesn’t always contain the identity permutation. In the later section, we derive a linear lower bound for the topswop problem by studying a specific family of permutation.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:lnu-104488 |
| Date | January 2021 |
| Creators | Desheng, Zhang |
| Publisher | Linnéuniversitetet, Institutionen för matematik (MA) |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
Page generated in 0.0016 seconds