arXiv · 2611.15116
Computing extensions of flag-jump t-modules
Abstract
We study Anderson t-modules whose positive-degree coefficient matrices admit a flag-jump basis and extend the t-reduction algorithm to this setting. We prove that these t-modules are abelian, with motive rank equal to the sum of their jump degrees. If $Φ$ has jump degrees $j_1,\ldots,j_d$ and $deg_τΨ<\min_s j_s$, we compute the t-module structure on ${\mathbf{Ext}}^1_τ(Φ,Ψ)$, its subgroup ${\mathbf{Ext}}_{0,τ}(Φ,Ψ)$, and the associated exact sequence. The construction allows nonzero nilpotent constant terms and includes the strictly pure case. When $Ψ$ is the Carlitz module, $N_Φ=0$, and all jump degrees are at least two, the construction yields a dual t-module. We give complexity bounds for the algorithms and implementations in SymPy and Mathematica.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
D. E. Kędzierski, D. Koellmer, P. Krasoń. 2026-11-13. Computing extensions of flag-jump t-modules. https://searcharxiv.com/abs/2611.15116
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.