pith. sign in

arxiv: 2412.19799 · v2 · pith:TDLDOGEWnew · submitted 2024-12-27 · 🧮 math.AC · math.AG

Computing Direct Sum Decompositions

classification 🧮 math.AC math.AG
keywords summandsalgorithmappliescasecomputingdecompositionsfinitelygenerated
0
0 comments X
read the original abstract

We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the computation of indecomposable summands of coherent sheaves on subvarieties of toric varieties (in particular, for varieties embedded in projective space); the second algorithm applies when R is local and k is a finite field, opening the door to computing decompositions in singularity theory. We also present multiple examples, including some which present previously unknown phenomena regarding the behavior of summands of Frobenius pushforwards (including in the non-graded case) and syzygies over Artinian rings.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.