Algorithms for determination of t-module structures on some extension groups

Abstract

In kk04 the second and third author extended the methods of pr and determined the module structure on 1(Φ,Ψ) where Φ and Ψ were Anderson modules over A= Fq[t] of some specific types. This approach involved the concept of biderivation and certain reduction algorithm. In this paper we generalize the results of pr and kk04 and present complete algorithm for computation of module structure on 1(Φ,Ψ) for modules Φ and Ψ such that degΦ> deg Ψ. The last condition is not sufficient for our algorithm to be executable. We show that it can be applied when the matrix at the biggest power of τ in Φt is invertible. We also introduce a notion of τ-composition series which we find suitable for the additive category of modules and show that under certain assumptions on the composition series of Φ and Ψ our algorithm is also executable.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…