We describe two combinatorial problems in the theory of automorphism groups of compact Riemann surfaces of genus two or greater: enumerate the topological actions of a finite group on surfaces and determine the set of genera of surfaces admitting such a group action, called the genus spectrum. We illustrate results...
Consider a polygon lying in the Euclidean plane with labeled edge lengths. The moduli space of polygons is the space of all polygons with the same labeled edge lengths, modulo orientation preserving isometries. It is well known that this space is generically a smooth manifold. For certain combinations of edge...
In this thesis I will look at a definition of computable randomness from Algorithmic Information Theory as defined by Andre Nies through the lens of Computable Analaysis asdefined by Klaus Weihrauch. I will show that despite the fact that these two paradigmsgenerate distinct classes of computable supermartingales, the class of...