Table of Contents
Fetching ...

Calculating The Local Ideal Class Monoid and Gekeler Ratios

Arix Eggink

Abstract

Let $A = \mathbb{F}_q[T]$, $\mathfrak{p} \subset A$ prime, $f(x) \in A[x]$ irreducible and set $R = A[x]/f(x)$. Denote its completion by $R_\mathfrak{p}$. The ideal class monoid $\text{ICM}(R_\mathfrak{p})$ is the set of fractional $R_\mathfrak{p}$ ideals modulo the principal $R_\mathfrak{p}$ ideals. We provide an algorithm to compute $\text{ICM}(R_\mathfrak{p})$. In the process we also get algorithms to compute the overorders and weak equivalence classes of $R_\mathfrak{p}$. We then use the algorithms to compute the product of local Gekeler ratios $\prod_{\mathfrak{p} \subset A} v_\mathfrak{p}(f) = \prod_{\mathfrak{p} \subset A} \lim_{n \rightarrow \infty} \frac{|\{M \in \text{Mat}_r(A/\mathfrak{p}^n)\mid \text{charpoly}(M)=f\}}{|\text{SL}_r(A/\mathfrak{p}^n)|/|\mathfrak{p}|^{n(r-1)}}$. This provides part of an algorithm to compute the weighted size of an isogeny class of Drinfeld modules.

Calculating The Local Ideal Class Monoid and Gekeler Ratios

Abstract

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.
Paper Structure (18 sections, 39 theorems, 56 equations)

This paper contains 18 sections, 39 theorems, 56 equations.

Key Result

Theorem 1.1

There exists an algorithm that given an irreducible $f \in A[x]$ computes $\prod_{\mathfrak{p} \subset A} v_\mathfrak{p}(f)$.

Theorems & Definitions (79)

  • Theorem 1.1
  • Definition 4.2
  • Lemma 4.3
  • proof
  • Lemma 4.4
  • Lemma 4.5
  • proof
  • Lemma 4.6
  • proof
  • Corollary 4.7
  • ...and 69 more