[FTheoryTools] Remove unused struct for QSM models

Author: HereAround

experimental/FTheoryTools/src/exports.jl

@@ -5,7 +5,6 @@ export FamilyOfG4Fluxes
 export FamilyOfSpaces
 export GlobalTateModel
 export HypersurfaceModel
-export QSMModel
 export WeierstrassModel
 export _blowup_global
 export _blowup_global_sequence

experimental/FTheoryTools/src/types.jl

@@ -153,85 +153,9 @@ end
 end
 
 
-##############################################################################
-# 3 Struct for Quadrillion F-theory Standard Models when read in from database
-##############################################################################
-
-struct QSMModel
-  # Information about the polytope underlying the F-theory QSM.
-  vertices::Vector{Vector{QQFieldElem}}
-  poly_index::Int
-
-  # We build toric 3-fold from triangulating the lattice points in said polytope.
-  # Oftentimes, there are a lot of such triangulations (up to 10^15 for the case at hand), which we cannot
-  # hope to enumerate in a reasonable time in a computer. The following gives us metadata, to gauge how hard
-  # this triangulation task is. First, the boolean triang_quick tells if we can hope to enumerate all
-  # triangulations in a reasonable time. This in turn is linked to the question if we can find
-  # fine regular triangulations of all facets, the difficulty of which scales primarily with the number of
-  # lattice points. Hence, we also provide the maximal number of lattice points in a facet of the polytope in question
-  # in the integer max_lattice_pts_in_facet. On top of this, an estimate for the total number of triangulations
-  # is provided by the big integer estimated_number_oftriangulations. This estimate is exact if triang_quick = true.
-  triang_quick::Bool
-  max_lattice_pts_in_facet::Int
-  estimated_number_of_triangulations::Int
-
-  # We select one of the many triangulations, construct a 3d toric base B3 and thereby the hypersurface model in question,
-  # that is then the key object of study of this F-theory construction.
-  hs_model::HypersurfaceModel
-
-  # As per usual, topological data of this geometry is important. Key is the triple intersection number of the
-  # anticanonical divisor of the 3-dimensional toric base, as well as its Hodge numbers.
-  Kbar3::Int
-  h11::Int
-  h12::Int
-  h13::Int
-  h22::Int
-
-  # Recall that B3 is 3-dimensional toric variety. Let s in H^0(B3, Kbar_B3), then V(s) is a K3-surface.
-  # Moreover, let xi the coordinates of the Cox ring of B3. Then V(xi) is a divisor in B3.
-  # Furthermore, Ci = V(xi) cap V(s) is a divisor in the K3-surface V(s). We study these curves Ci in large detail.
-  # Here is some information about these curves:
-  genus_ci::Dict{MPolyDecRingElem{QQFieldElem, QQMPolyRingElem}, Int}
-  degree_of_Kbar_of_tv_restricted_to_ci::Dict{MPolyDecRingElem{QQFieldElem, QQMPolyRingElem}, Int}
-  intersection_number_among_ci_cj::Matrix{Int}
-  index_facet_interior_divisors::Vector{Int}
-  intersection_number_among_nontrivial_ci_cj::Matrix{Int}
-  
-  # The collection of the Ci form a nodal curve. To every nodal curve one can associate a (dual) graph. In this graph,
-  # every irreducible component of the nodal curve becomes a node/vertex of the dual graph, and every
-  # nodal singularity of the nodal curve turns into an edge of the dual graph. Here this is rather simple.
-  # Every Ci above is an irreducible component of the nodal curve in question and the topological intersection numbers
-  # among the Ci tell us how many nodal singularities link the Ci. Hence, we construct the dual graph as follows:
-  # 1. View the Ci as nodes of an undirected graph G.
-  # 2. If the top. intersection number of Ci and Cj is zero, there is no edge between the nodes of G corresponding to Ci and Cj.
-  # 3. If the top. intersection number of Ci and Cj is n (> 0), then there are n edges between the nodes of G corresponding to Ci and Cj.
-  # The following lists the information about this dual graph.
-  # Currently, we cannot label the nodes/vertices of a OSCAR graph. However, it is important to remember what vertex/node in the
-  # dual graph corresponds to which geometric locus V(xi, s). Therefore, we keep the labels that link the node of the OSCAR graph
-  # to the geometric loci V(xi, s) in the vector components_of_dual_graph::Vector{String}. At least for now.
-  # Should it ever be possible (favorable?) to directly attach these labels to the graph, one can remove components_of_dual_graph.
-  dual_graph::Graph{Undirected}
-  components_of_dual_graph::Vector{String}
-  degree_of_Kbar_of_tv_restricted_to_components_of_dual_graph::Dict{String, Int64}
-  genus_of_components_of_dual_graph::Dict{String, Int64}
-
-  # In our research, we conduct certain combinatoric computations based on this graph, the data in
-  # degree_of_Kbar_of_tv_restricted_to_components_of_dual_graph, genus_of_components_of_dual_graph and a bit more meta data
-  # that is not currently included (yet). These computations are hard. It turns out, that one can replace the graph with another
-  # graph, so that the computations are easier (a.k.a. the runtimes are a lot shorter). In a nutshell, this means to remove
-  # a lot of nodes, and adjust the edges accordingly. Let me not go into more details here. A full description can e.g. be found in
-  # https://arxiv.org/abs/2104.08297 and the follow-up papers thereof. Here we collect the information of said simplified graph,
-  # by mirroring the strategy for the above dual graph.
-  simplified_dual_graph::Graph{Undirected}
-  components_of_simplified_dual_graph::Vector{String}
-  degree_of_Kbar_of_tv_restricted_to_components_of_simplified_dual_graph::Dict{String, Int64}
-  genus_of_components_of_simplified_dual_graph::Dict{String, Int64}
-  
-end
-
 
 ################################################
-# 4: The julia type for G4-fluxes
+# 3: The julia type for G4-fluxes
 ################################################
 
 @attributes mutable struct G4Flux
@@ -243,7 +167,7 @@ end
 
 
 ################################################
-# 5 The julia type for a family of G4-fluxes
+# 4 The julia type for a family of G4-fluxes
 ################################################
 
 @attributes mutable struct FamilyOfG4Fluxes