<h3>1 <span class="Heading">Introduction and Main Functions</span></h3>
<p>This chapter provides an overview of the background material, and provides documentation for the main functions and data structures of the MapClass package.</p>
<p>Let <span class="SimpleMath">G</span> be a finite group, let <span class="SimpleMath">C_1,..., C_r</span> be a collection of conjugacy classes in <span class="SimpleMath">G</span>. Let <span class="SimpleMath">mathcalE = mathcalE(G,g,(C_1, dots, C_r))</span> denote the set of all tuples <span class="SimpleMath">σ = (σ_1,...,σ_2g+r)∈ G^2g+r</span> (for natural numbers <span class="SimpleMath">g</span> and <span class="SimpleMath">r</span>) of elements in <span class="SimpleMath">G</span> satisfying the relation</p>
<p>and such that <span class="SimpleMath">σ_2g +k ∈ C_k</span>. If the tuple also satisfies <span class="SimpleMath">⟨ σ_1, ..., σ_2g+r⟩ = G</span> it is said to be <em>generating</em>.</p>
<p>One may associate the elements of the tuple <span class="SimpleMath">σ</span> with the standard generators of the fundamental group of a compact connected surface <span class="SimpleMath">S</span> (genus <span class="SimpleMath">g</span>, <span class="SimpleMath">r</span> punctures). The mapping class group of <span class="SimpleMath">S</span> is naturally isomorphic to <span class="SimpleMath">Out(π_1(S))</span> and so gives rise to an action on the fundamental group of <span class="SimpleMath">S</span> modulo inner automorphisms. This action can be transferred to an action on the set <span class="SimpleMath">mathcalE</span> (up to conjugation in <span class="SimpleMath">G</span>). The <em>mapping class orbits</em> are the orbits of <span class="SimpleMath">mathcalE</span> under this action.</p>
<p>The package can be used to compute the set <span class="SimpleMath">mathcalE(G, g, (C_1,...,C_r))</span> and the corresponding partition into mapping class orbits for a given group <span class="SimpleMath">G</span> and a set of conjugacy classes <span class="SimpleMath">(C_1,...,C_r)</span> (although the programs expect a tuple of class representatives). For an example application see Section <a href="chap1.html#X7A3C63AC854BCF4C"><span class="RefLink">1.5</span></a>. We call the tuple <span class="SimpleMath">(g;C_1,...,C_r)</span> the signature. The package is an extension of the <em>Braid</em> package for <strong class="pkg">GAP</strong>.</p>
<h4>1.2 <span class="Heading">Overview of Main
Functions</span></h4>
<p>The following are the principal ways for calculating the mapping class orbits for a given signature and group. We require our groups to be permutation groups, and the tuple in question to have length at least two.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AllMCOrbits</code>( <var class="Arg">group</var>, <var class="Arg">genus</var>, <var class="Arg">tuple</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>This function calculates the orbits for the given group, genus and tuple. This function is a wrapper for the function <code class="func">AllMCOrbitsCore</code> (<a href="chap1.html#X791C18967E0DFC70"><span class="RefLink">1.2-2</span></a>), and so can make use of GAP's <code class="keyw">OptionsStack</code>. The options are described in more detail in the documentation for <code class="func">AllMCOrbitsCore</code> (<a href="chap1.html#X791C18967E0DFC70"><span class="RefLink">1.2-2</span></a>). We draw attention to two useful options: the <code class="code">OutputStyle</code> and <code class="code">SaveOrbit</code> options. The <code class="code">SaveOrbit</code> option takes values of either <code class="keyw">false</code> - in which case the orbit is not saved to a file - or it accepts a string that is the name of a directory in which the routine saves the orbits. See <code class="func">AllMCOrbitsCore</code> (<a href="chap1.html#X791C18967E0DFC70"><span class="RefLink">1.2-2</span></a>) for more details on the saving process. The <code class="code"> OutputStyle </code> option controls the verbosity of the output of the function. It accepts three possible values:</p>
<ul>
<li><p><code class="code">"silent"</code> -- the routine prints no output except in the case of an Error.</p>
</li>
<li><p><code class="code">"single-line"</code> -- the routine prints output to a single line. An intermediate outputstyle for those who want some output but do not want to see all diagnostic output.</p>
</li>
<li><p><code class="code">"full"</code> -- the routine provides full diagnostic output.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ AllMCOrbitsCore</code>( <var class="Arg">group</var>, <var class="Arg">genus</var>, <var class="Arg">tuple</var>, <var class="Arg">partition</var>, <var class="Arg">constant</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>This function calculates the orbits for the given group, genus and tuple, with the <span class="SimpleMath">r</span> branch points partitioned as in <var class="Arg">partition</var>. It uses the given <var class="Arg">constant</var> to determine how many of the tuples it want to account for before exiting. This function also make use of GAP's <code class="keyw">OptionsStack</code> if one desires to alter how the algorithm runs. The following options and their defaults are given below.</p>
<p>When trying to search for orbits it can be the case that the routine struggles to find a small orbit because of the low probability of randomly choosing a tuple in the orbit. To combat this problem the routine does not choose tuples entirely randomly but uses a weighted random selection to increase the probability of selecting tuples appearing in small tuples. To small subgroups of our group we have an associated weight. When a subgroup is generated by a tuple in our orbit frequently then we reduce its weight. Subgroups which do not appear often have their weight increased. The options <code class="code">MaximumWeight</code>, <code class="code">MinimumWeight</code>, <codeclass="code">InitialWeight</code>,<code class="code">BumpUp</code>, and <code class="code">KnockDown</code>, control this subgroup weighting. Each option takes positive integer values. They play the following roles in the weighting process:</p>
<ul>
<li><p><code class="code">MaximumWeight</code> : The maximum weight that a subgroup can be.</p>
</li>
<li><p><code class="code">MinimumWeight</code> : The minimum weight that a subgroup can be.</p>
</li>
<li><p><code class="code">InitialWeight</code> : The weight that a new subgroup receives when added to to the list of small subgroups.</p>
</li>
<li><p><code class="code">BumpUp</code> : The amount we increase the weight of a subgroup by when it does not appear frequently.</p>
</li>
<li><p><code class="code">KnockDown</code> : The amount we decrease the weight of a subgroup by when it appears too frequently.</p>
</li>
</ul>
<p>The default options were chosen experimentally and so it may be beneficial to tune these values for a specific case.</p>
<p>The option <code class="code">InitialNumberOfRandomTuples</code> decides how many tuples the routine collects before trying to see if they are in some pre-existing orbit.</p>
<p>The option <code class="code">SaveOrbit</code> which is by default <code class="keyw">false</code> can be set to the name of a directory in which you want to save orbits. This option then saves the orbits to files in the folder with "<code class="file">_name</code>". So for example if you wish to save your orbits into the file <code class="file">_example</code> then you would run <code class="code">AllMCOrbits(group, genus, tuple: SaveOrbit:="example");</code>. The orbits are then saved in orbits which are named numerically. Following on from the above example then the first orbit will be saved as "_example/0". The <code class="code"> OutputStyle </code> option controls the verbosity of the output. It accepts three possible values:</p>
<ul>
<li><p><code class="code">"silent"</code> - the routine prints no output except in the case of an Error.</p>
</li>
<li><p><code class="code">"single-line"</code> - the routine output to a single line. An intermediate outputstyle for those who want some output but do not want to see all diagnostic output.</p>
</li>
<li><p><code class="code">"full"</code> - the routine provides full diagnostic output.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ GeneratingMCOrbits</code>( <var class="Arg">group</var>, <var class="Arg">genus</var>, <var class="Arg">tuple</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>This calculates the orbits for the given arguments. Unlike the <code class="func">AllMCOrbits</code> (<a href="chap1.html#X7820883E8607F7AF"><span class="RefLink">1.2-1</span></a>) function, <code class="code">GeneratingMCOrbits</code> calculates only those orbits whose tuples generate the whole of our original group.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ GeneratingMCOrbitsCore</code>( <var class="Arg">group</var>, <var class="Arg">genus</var>, <var class="Arg">tuple</var>, <var class="Arg">partition</var>, <var class="Arg">constant</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>This calculates the orbits for the given arguments. Unlike the <code class="func">AllMCOrbits</code> (<a href="chap1.html#X7820883E8607F7AF"><span class="RefLink">1.2-1</span></a>) function, <code class="code">GeneratingMCOrbitsCore</code> calculates only those orbits whose tuples generate the whole of our original group. As with <code class="func">AllMCOrbitsCore</code> (<a href="chap1.html#X791C18967E0DFC70"><span class="RefLink">1.2-2</span></a>), the argument <varclass="Arg">partition</var> must be a partition of the conjugacy classes represented in list form. We also have access to the full value of the options stack as in <code class="func">AllMCOrbitsCore</code> (<a href="chap1.html#X791C18967E0DFC70"><span class="RefLink">1.2-2</span></a>).</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MappingClassOrbit</code>( <var class="Arg">group</var>, <var class="Arg">genus</var>, <var class="Arg">principaltuple</var>, <var class="Arg">partition</var>, <var class="Arg">tuple</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: an orbit record for an orbit containing tuple or returns <code class="keyw">fail</code></p>
<p>Calculates the orbit of the <var class="Arg">tuple</var> with respect to the given <var class="Arg">group</var>, <var class="Arg">principaltuple</var> and <var class="Arg">genus</var>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ PrepareMinTree</code>( <var class="Arg">principaltuple</var>, <var class="Arg">group</var>, <var class="Arg">ourR</var>, <var class="Arg">genus</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: a record with two keys <code class="code">MinimizationTree</code> and <code class="code">MinimumSet</code>. If <code class="code">record</code> is the returned record then <code class="code">record.MinimizationTree</code> is the list encoding the tree used to help minimize tuples. The list <code class="code"> record.MinimumSet</code> is a list of minimal elements which is also used to speed up tuple minimization.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ MinimizeTuple</code>( <var class="Arg">tuple</var>, <var class="Arg">minimizationTree</var>, <var class="Arg">minimumSet</var>, <var class="Arg">numberOfGenerators</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the minimal tuple in the same orbit of <var class="Arg">tuple</var>.</p>
<p>Take the minimisation data provided by <code class="func">PrepareMinTree</code> (<a href="chap1.html#X7E26117582BDD678"><span class="RefLink">1.2-6</span></a>) and minimizes the given <varclass="Arg">tuple</var>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ EasyMinimizeTuple</code>( <var class="Arg">group</var>, <var class="Arg">genus</var>, <var class="Arg">tuple</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the minimal tuple in the same orbit as <var class="Arg">tuple</var>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ FindTupleInOrbit</code>( <var class="Arg">orbit</var>, <var class="Arg">tuple</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the index of <var class="Arg">tuple</var> in <code class="code">orbit.TupleTable</code> if in the <var class="Arg">orbit</var>. If the tuple is not in <var class="Arg">orbit</var> returns <code class="keyw">fail</code>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ NumberGeneratingTuples</code>( <var class="Arg">group</var>, <var class="Arg">partition</var>, <varclass="Arg">tuple</var>, <var class="Arg">genus</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the total number of possible generating tuples for the group and tuple.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ TotalNumberTuples</code>( <var class="Arg">group</var>, <var class="Arg">tuple</var>, <var class="Arg">genus</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the total number of tuples we have to account for.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ CalculateTuplePartition</code>( <var class="Arg">group</var>, <var class="Arg">tuple</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: A partition of <span class="Math">{1,\ldots, r}</span> where <span class="Math">r</span> is the length of the tuple.</p>
<p>The function returns a partition of <span class="Math">{1,\ldots, r}</span> such that <span class="SimpleMath">i</span> and <span class="SimpleMath">j</span> lie in the same block if and only if the elements <code class="code">tuple[i]</code> and <code class="code">tuple[j]</code> are member of the same conjugacy class. The program currently requires that the elements of the tuple be ordered such that if <code class="code">tuple[i]</code> and <code class="code">tuple[j]</code> are in the same conjugacy class with <span class="SimpleMath">i ≤ j</span> then so is<code class="code">tuple[k]</code> for all <span class="SimpleMath">i ≤ k ≤ j</span>.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ RestoreOrbitFromFile</code>( <var class="Arg">n</var>, <var class="Arg">name</var>[, <var class="Arg">path</var>] )</td><td class="tdright">( function )</td></tr></table></div>
<p>Returns: the n-th orbit record from the project with project <code class="code">"name"</code></p>
<p>By default the function searches the current working directory for the saved project folder and searches inside this for the n-th orbit. If no such orbit exists it returns <code class="keyw">fail</code>. If an optional argument <var class="Arg">path</var> is provided then it searches this path for a folder with the name specified (note that path expects a <code class="code">Directory</code> object). If an orbit exists then it is returned as a record as outlined in the data structure section.</p>
<div class="func"><table class="func" width="100%"><tr><td class="tdleft"><code class="func">‣ SaveOrbitToFile</code>( <var class="Arg">orbit</var>, <var class="Arg">n</var>, <var class="Arg">name</var> )</td><td class="tdright">( function )</td></tr></table></div>
<p>Saves the orbit to filename "<var class="Arg">n</var>" in the directory <code class="code">'_name'</code>. The directory must already exist.</p>
</li>
<li><p><code class="code">OurFreeGroup </code>- a free group on <code class="code">NumberOfGenerators </code>letters</p>
</li>
<li><p><code class="code">AbsGens </code>- generators for <code class="code">OurFreeGroup</code></p>
</li>
<li><p><code class="code">OurAlpha </code> - generators of <code class="code">OurFreeGroup</code>corresponding to the <span class="SimpleMath">α_i</span> type loops in the fundamental group ( the first <span class="SimpleMath">g</span> elements of <code class="code">AbsGens</code>)</p>
</li>
<li><p><code class="code">OurBeta </code>- elements of <code class="code">OurFreeGroup </code>corresponding to <span class="SimpleMath">β</span> type loops</p>
</li>
<li><p><code class="code">OurGamma </code>- generators of <code class="code">OurFreeGroup </code>corresponding to the loops around branch points</p>
</li>
<li><p><code class="code">TupleTable </code>- a table containing all the tuples in the orbit</p>
<p>The tuple table is a list. Each element of the list is a record with the names, tuple and next. If <code class="code">orbit</code> is an orbit object then <code class="code">orbit.TupleTable[n].tuple</code> returns the tuple at index <span class="SimpleMath">n</span> of the tuple table.</p>
Length=3072
Generating Tuple =[ (1,2,4,5,3), (1,4,5,2,3), (1,2)(4,5),
(1,4)(2,3), (2,5)(3,4) ]
Generated subgroup size=60
Centralizer size=1
4800 tuples remaining
Cleaning current orbit...
Cleaning a list of 20 tuples
Random Tuples Remaining: 0
Cleaning done; 0 random tuples remaining
Collecting 20 random tuples... done
Cleaning orbit 1
Cleaning a list of 20 tuples
Random Tuples Remaining: 0
Cleaning done; 0 random tuples remaining
Collecting 40 random tuples... done
Cleaning orbit 1
Cleaning a list of 40 tuples
Random Tuples Remaining: 3
Cleaning done; 3 random tuples remaining
Orbit 2:
Length=32
Generating Tuple =[ (1,4)(2,3), (1,2)(3,4), (1,4)(2,3), (1,2)(3,4),
(1,3)(2,4) ]
Generated subgroup size=4
Centralizer size=4
4320 tuples remaining
Cleaning current orbit...
Cleaning a list of 3 tuples
Random Tuples Remaining: 2
Cleaning done; 2 random tuples remaining
Orbit 3:
Length=72
Generating Tuple =[ (1,5,2), (1,3,2), (1,2)(3,5), (1,3)(2,5),
(1,3)(2,5) ]
Generated subgroup size=12
Centralizer size=1
0 tuples remaining
Cleaning current orbit...
Cleaning a list of 2 tuples
Random Tuples Remaining: 0
Cleaning done; 0 random tuples remaining
<span class="GAPprompt">gap></span> <span class="GAPinput"># Check we have as many orbits as it says...</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(orbits);</span>
3
<span class="GAPprompt">gap></span> <span class="GAPinput"># Inspect the first orbit..</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">orb1:=orbits[1];;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput"># How long is orb1?</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(orb1.TupleTable);</span>
3072
<span class="GAPprompt">gap></span> <span class="GAPinput"># Select element 42 ...</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">SelectTuple(orb1, 42);</span>
[ (1,3,4), (1,5,3,2,4), (1,5)(2,4), (1,2)(3,5), (2,3)(4,5) ]
<span class="GAPprompt">gap></span> <span class="GAPinput"># Save the orbit to a file...</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">SaveOrbitToFile(orb1, 1, "test");</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">#If the folder doesn't exist we get an error..</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">SaveOrbitToFile(orb1, 1, "foo");</span>
AppendTo: cannot open '_foo/1' for output at
CallFuncList( APPEND_TO, arg );
<span class="GAPprompt">gap></span> <span class="GAPinput">#</span>
<span class="GAPprompt">gap></span> <span class="GAPinput"># Now we try find generating orbits </span>
<span class="GAPprompt">gap></span> <span class="GAPinput">group:=SymmetricGroup(5);</span>
Sym( [ 1 .. 5 ] )
<span class="GAPprompt">gap></span> <span class="GAPinput"># And we will save them using the `SaveOrbit` option</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">GeneratingMCOrbits(group,1,tuple : SaveOrbit:="example");;</span>
Total Number of Tuples: 607680
Collecting 20 generating tuples .. done
Cleaning done; 20 random tuples remaining
Orbit 1:
Length=5064
Generating Tuple =[ (1,3,2,5), (2,4,3), (1,4)(3,5), (1,3)(2,5),
(1,4)(3,5) ]
Generated subgroup size=120
Saving orbit to file _example/0
Centralizer size=1
0 tuples remaining
Cleaning current orbit...
Cleaning a list of 20 tuples
Random Tuples Remaining: 0
Cleaning done; 0 random tuples remaining
<span class="GAPprompt">gap></span> <span class="GAPinput">generatingorbits:=last;;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput"># How many generating orbits are there?</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(generatingorbits);</span>
1
<span class="GAPprompt">gap></span> <span class="GAPinput"># Is this orbit equal to the other one we found earlier</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">IsEqualOrbit(orb1, generatingorbits[1]);</span>
fail
<span class="GAPprompt">gap></span> <span class="GAPinput"># We can reload the orbits...</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">orb2:=RestoreOrbitFromFile(0, "example");;</span>
<span class="GAPprompt">gap></span> <span class="GAPinput">Length(orb2.TupleTable);</span>
5064
</pre></div>
<p>This section describes an application of the package.</p>
<p>Let <span class="SimpleMath">X</span> be a compact Riemann surface of genus <span class="SimpleMath">g</span> and <span class="SimpleMath">f: X → P^1C</span> be a meromorphic function of degree <span class="SimpleMath">n</span>. Let <span class="SimpleMath">B</span> be the set of branch points for <span class="SimpleMath">f</span> and fix a basepoint <span class="SimpleMath">b_0 ∈ P^1C- B</span>. The fundamental group <span class="SimpleMath">π_1(P^1 C - B, b_0)</span> acts transitively on the fibre <span class="SimpleMath">f^-1(b_0)</span> and this corresponds to a representation</p>
<p>The image of <span class="SimpleMath">f^*</span> is called the <em>monodromy group</em> of <span class="SimpleMath">(X, f)</span>. The fundamental group of the punctured Riemann sphere is generated by the loops that wind around the points in <span class="SimpleMath">B</span>. Label the branch points <span class="SimpleMath">b_1,...,b_r</span> and let <span class="SimpleMath">τ_i</span> be the image under <span class="SimpleMath">f^*</span> of the loop, <span class="SimpleMath">γ_i ∈ π_1(P^1C - B)</span>, that winds once around the point <span class="SimpleMath">b_i∈ B</span>. Therefore,</p>
<p class="pcenter">
\langle \tau_1, ..., \tau_r \rangle = G
</p>
<p>where the <span class="SimpleMath">ind(τ_i)</span> is the minimal number of factors to express <span class="SimpleMath">τ_i</span> as a product of transpositions. A set <span class="SimpleMath">t_1, ..., t_r</span> of elements of <span class="SimpleMath">S_n</span> satisfying the Riemann-Hurwitz formula, the product-one condition, and generating some transitive subgroup <span class="SimpleMath">G</span> of <span class="SimpleMath">S_n</span> is called a <em>genus </em> <span class="SimpleMath">g</span> <em>generating system </em> for <span class="SimpleMath">G</span>. Therefore to the meromorphic function <span class="SimpleMath">(X, f)</span> there is an associated genus <span class="SimpleMath">g</span> system. In fact the conjugacy classes of the elements <span class="SimpleMath">τ_i</span> are also determined by <span class="SimpleMath">f</span> -- the collection of conjugacy classes is sometimes called the <em> ramification type</em> of <span class="SimpleMath">f</span>. On the other hand for every genus <span class="SimpleMath">g</span> generating system, <span class="SimpleMath">t = (τ_1, ..., τ_n)</span> for <span class="SimpleMath">G</span> there is Riemann surface of genus <span class="SimpleMath">g</span> and a meromorphic function with associated generating system <span class="SimpleMath">t</span> -- this result is known as <em> Riemann's Existence Theorem</em>.</p>
<p>The question we hope to use our package to answer is: For a given finite group <span class="SimpleMath">G</span> how many meromorphic maps with monodromy group <span class="SimpleMath">G</span> are there? It can be shown -- see <a href="chapBib.html#biBVolklein96">[V\t96]</a> for example -- that determining whether two genus <span class="SimpleMath">g</span> coverings are equivalent corresponds to determining whether their associated genus <span class="SimpleMath">g</span> systems are in the same mapping class orbit ( most literature would refer to mapping class orbits as braid orbits in this case - this is because of the equivalence between the mapping class group of a punctured disc and the braid groups <a href="chapBib.html#biBBirman75">[Bir75]</a>).</p>
<p>Thus for a finite group <span class="SimpleMath">G</span> we can answer the above principal question using the following process:</p>
<ul>
<li><p>For a given finite group <span class="SimpleMath">G</span> the work of Breuer <a href="chapBib.html#biBBreuer00">[Bre00]</a> can be used to calculate all possible ramification types.</p>
</li>
<li><p>Pick a tuple, <span class="SimpleMath">C = (c_1,...,c_r)</span>, of representative elements of the conjugacy classes which correspond to a chosen ramification type as calculated in the previous step.</p>
</li>
<li><p>Use the function <code class="code">GeneratingMCOrbits(G, 0, [c1,...,cr])</code> to calculate the number of mapping class orbits. Note that the genus argument is <span class="SimpleMath">0</span> because this is the genus of <span class="SimpleMath">P^1C</span>.</p>
</li>
</ul>
<p>For more information on this process and the underlying theory see <a href="chapBib.html#biBMSV">[MSSV02]</a> and <a href="chapBib.html#biBVolklein96">[V\t96]</a>.</p>
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.
