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

In their recent work the second and the third authors extended the methods of M. A. Papanikolas and N. Ramachandran and determined the t-module structure on [Formula: see text] where [Formula: see text] and [Formula: see text] were Anderson t-modules over [Formula: see text] of some specific types. This approach involved the concept of biderivation and certain reduction algorithm. In this paper, we generalize these results and present a complete algorithm for computation of t-module structure on [Formula: see text] for t-modules [Formula: see text] and [Formula: see text] such that [Formula: see text] 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 [Formula: see text] in [Formula: see text] is invertible. We also introduce a notion of [Formula: see text]-composition series which we find suitable for the additive category of t-modules and show that under certain assumptions on the composition series of [Formula: see text] and [Formula: see text] our algorithm is also executable.

Authors

Institutions

Publication Details

Journal
International Journal of Number Theory
Published
2025-04-23
DOI
https://doi.org/10.1142/s1793042125500927
Primary Topic
Polynomial and algebraic computation
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Dawid E. Kędzierski, Piotr Krasoń, Filip Głoch
International Journal of Number Theory
Polynomial and algebraic computation
article

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

Dawid E. Kędzierski, Piotr Krasoń, Filip Głoch
article en

Abstract

In their recent work the second and the third authors extended the methods of M. A. Papanikolas and N. Ramachandran and determined the t-module structure on [Formula: see text] where [Formula: see text] and [Formula: see text] were Anderson t-modules over [Formula: see text] of some specific types. This approach involved the concept of biderivation and certain reduction algorithm. In this paper, we generalize these results and present a complete algorithm for computation of t-module structure on [Formula: see text] for t-modules [Formula: see text] and [Formula: see text] such that [Formula: see text] 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 [Formula: see text] in [Formula: see text] is invertible. We also introduce a notion of [Formula: see text]-composition series which we find suitable for the additive category of t-modules and show that under certain assumptions on the composition series of [Formula: see text] and [Formula: see text] our algorithm is also executable.

International Journal of Number TheoryVol. 21(08)
University of Szczecin (PL)
Openalex Percentile: Top 91%
Polynomial and algebraic computation
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.