removed Markdown

oscar-system · Apr 23, 2023 · 20ab80e · 20ab80e
1 parent 02918d3
commit 20ab80e
Show file tree

Hide file tree

Showing 2 changed files with 6 additions and 13 deletions.
diff --git a/experimental/BasisLieHighestWeight/src/BasisLieHighestWeight.jl b/experimental/BasisLieHighestWeight/src/BasisLieHighestWeight.jl
@@ -3,14 +3,12 @@ export basis_lie_highest_weight
 export is_fundamental
 
 using Polymake
-# using Distributed
-using Markdown
 
 include("./NewMonomial.jl")
 
 fromGap = Oscar.GAP.gap_to_julia
 
-@doc Markdown.doc"""
+@doc """
     basisLieHighestWeight(type::String, rank::Int, highest_weight::Vector{Int}; 
     operators::Union{String, Vector{Int}} = "regular", 
     monomial_order::Union{String, Function} = "GRevLex", cache_size::Int = 0, 
@@ -288,7 +286,7 @@ function compute_monomials(type::String, rank::Int, lie_algebra::GAP.Obj, ZZx::Z
     end
 end
 
-@doc Markdown.doc"""
+@doc """
     is_fundamental(highest_weight::Vector{Int})::Bool
 
     returns true if ``highest_weight`` is fundamental, i.e. [0, ..., 1, ..., 0]

diff --git a/experimental/BasisLieHighestWeight/test/MBOld.jl b/experimental/BasisLieHighestWeight/test/MBOld.jl
@@ -1,7 +1,8 @@
  # This file is an old version of the algorithm that can compute (not all cases) of 
- # BasisLieHighestWeight.basis_lie_highest_weight and is used in runtests.jl to check that the newer algorithm matches
+ # BasisLieHighestWeight.basis_lie_highest_weight and is used only in runtests.jl to check that the newer algorithm matches
  # There is code doubling, but I am not sure how the src part is going to change when its integrated with the other
- # lie algebra work.
+ # lie algebra work and would prefer to change this file after doing the integration to make sure that everything stays
+ # correct.
 
 
 module MBOld
@@ -193,11 +194,6 @@ function tensorMatricesForOperators(L, hw, ops)
     return mats
 end
 
-#### monomial basis
-
-
-# TODO: Demazure modules
-
 
 """
     basisLieHighestWeight(t::String, n::Int, hw::Vector{Int}; parallel::Bool = true) :: Tuple{Vector{Vector{Short}},Vector{TVec}}
@@ -219,7 +215,6 @@ function basisLieHighestWeight(t::String, n::Int, hw::Vector{Int}; roots = []) #
     wts = weightsForOperators(L, CH[3], ops)
     wts = (v->Int.(v)).(wts)
 
-    #--- mats speichert die Matrizen g_i für (g_1^a_1 * ... * g_k^a_k)*v0 ab.
     mats = tensorMatricesForOperators(L, hw, ops)
     hwv = sparse_row(ZZ, [(1,1)])
 
@@ -303,4 +298,4 @@ function compute(v0, mats, wts::Vector{Vector{Int}})
     return monomials
 end
 
-end # module
+end