Iterated Extensions and Uniserial Length Categories
Eivind Eriksen

TL;DR
This paper investigates uniserial length categories using iterated extensions, providing a new elementary proof for uniseriality criteria, classifying indecomposables, and applying results to graded holonomic D-modules on monomial curves.
Contribution
It offers a new constructive proof for uniseriality criteria and classifies indecomposable objects in uniserial length categories, with applications to D-modules.
Findings
Established a necessary and sufficient criterion for uniseriality
Classified all indecomposable objects in uniserial length categories
Applied methods to classify graded holonomic D-modules on monomial curves
Abstract
In this paper, we study length categories using iterated extensions. We consider the problem of classifying all indecomposable objects in a length category, and the problem of characterizing those length categories that are uniserial. We solve the last problem, and obtain a necessary and sufficient criterion for uniseriality under weak assumptions. This criterion turns out to be known by Amdal and Ringdal already in 1968; we give a new proof that is both elementary and constructive. The first problem is the most fundamental one, and its general solution is "the main and perhaps hopeless purpose of representation theory" according to Gabriel. We solve the problem in the case when the length category is uniserial, using our constructive methods. As an application, we classify all graded holonomic -modules on a monomial curve over the complex numbers, obtaining the most explicit results…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
