加载中…
Let , prime, irreducible and set . Denote its completion by . The ideal class monoid is the set of fractional ideals modulo the principal ideals. We provide an algorithm to compute . In the process we also get algorithms to compute the overorders and weak equivalence classes of . We then use the algorithms to compute the product of local Gekeler ratios . This provides part of an algorithm to compute the weighted size of an isogeny class of Drinfeld modules.

生成讲解博客的中文版本

生成AI智能校验的中文版本