You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Twisted polygonal surfaces can be constructed by chamber involutions. This allows the application of group-theoretical tools. An example would be the computation of geodesic self-dual surfaces from my dissertation (the code lies in utilities/FindSelfDual.g after PR #154)).
The general procedure is:
Describe the desired structure by the chamber involutions (relations and other conditions)
Construct a finitely presented group with 3 generators, that fulfill those relations.
Find the desired subgroups, maybe using further conditions.
Compute a permutation representation of the coset action (FactorCosetAction)
Use TwistedPolygonalSurfaceByChamberInvolutions(...)
Since this shows a nice interplay between the group-theoretic methods in GAP and the functionality of this package, this should become an example in the "Example Applications"-chapter (maybe the third or fourth example?).
It should be noted that most of the "magic" happens in the group-theoretic algorithms already implemented. The example is probably still worth including since knowing which algorithms about free groups are relevant is not common knowledge. Thus, the example should also reintroduce some of the required concepts in GAP (how to construct free groups, relations, presentations, homomorphisms,...).
The text was updated successfully, but these errors were encountered:
Twisted polygonal surfaces can be constructed by chamber involutions. This allows the application of group-theoretical tools. An example would be the computation of geodesic self-dual surfaces from my dissertation (the code lies in utilities/FindSelfDual.g after PR #154)).
The general procedure is:
Since this shows a nice interplay between the group-theoretic methods in GAP and the functionality of this package, this should become an example in the "Example Applications"-chapter (maybe the third or fourth example?).
It should be noted that most of the "magic" happens in the group-theoretic algorithms already implemented. The example is probably still worth including since knowing which algorithms about free groups are relevant is not common knowledge. Thus, the example should also reintroduce some of the required concepts in GAP (how to construct free groups, relations, presentations, homomorphisms,...).
The text was updated successfully, but these errors were encountered: