To view this page in the traditional github tree view, click here.
All references below are to the arxiv version of this paper, available here.
SavedDatabase_23_3.mag
is a Magma file containing the output of the computation described in Section 7.1, which was recorded in Corollary 1.8. It was created by running the file CreateDatabase.mag
described below.
Database
of 4953 GroupCountingInfo
records, corresponding to the 4953 transitive groups of degree up to 23.GroupCountingInfo
record is a bespoke record type, whose objects have the following properties:
degree
: The degree of the permutation grouplabel
: The label of the permutaiton group within its degree, i.e. the group is TransitiveGroup(degree, label)
in Magmamalleindex
: The Malle index of the groupbound
: The best known exponent in an upper bound for G-extensions that follows from our methodsconjecture
: A boolean indicating whether the number field counting conjecture is known for G-extensions over Q.isnilpotent
: A boolean indicating whether G is nilpotentissolvable
: A boolean indicating whether G is solvableisconcentrated
: A boolean indicating whether G is concentrated.output.txt
contains the text output of running the file CreateDatabase.mag
.CreateDatabase.mag
is the main Magma file used to generate the database.
MaxDegree
(set to 23) and number_of_repeats
(set to 3), which is the number of times to iterate through the list.utils/
directory:
utils/CountingInvariants.mag
: Computes the index of a permutation group and the minimal index subgrouputils/NumberFieldBounds.mag
: Computes various upper bounds on the number of G-extensionsutils/InitializeDatabase.mag
: Initializes the database, and contains the definition of the GroupCountingInfo
record.utils/GroupConstructions.mag
: Creates certain different types of groupsutils/Comparing_Orderings.mag
: Has code used to compare the different pushforward discriminantsutils/Pontryagin_Dual_Class_Group_Bounds.mag
: Implements an upper bound on H1_ur using the Pontryagin dual, i.e. Lemma 4.1utils/ConjectureIsKnown.mag
: Runs through the database, and records some groups for which the field counting conjecture is knownutils/InductiveCounting.mag
: Does the hard work, and actually iterates through the database, updating the best known upper bound and detecting whether we may infer the field counting conjecture.inductivemethods.tar.gz
containing all the contents of this folder.