Pith. sign in

REVIEW 1 cited by

Approximation by interval-decomposables and interval resolutions of persistence modules

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2207.03663 v3 pith:LOXGWUVW submitted 2022-07-08 math.RT math.AT

classification math.RTmath.AT
keywords intervalapproximationresolutionsapproximationscommutativefiniteformulapersistence
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In topological data analysis, two-parameter persistence can be studied using the representation theory of the 2d commutative grid, the tensor product of two Dynkin quivers of type A. In a previous work, we defined interval approximations using restrictions to essential vertices of intervals together with Mobius inversion. In this work, we consider homological approximations using interval resolutions, and show that the interval resolution global dimension is finite for finite posets and that it is equal to the maximum of the interval dimensions of the Auslander-Reiten translates of the interval representations. In fact, for the latter equality, we obtained a general formula in the setting of finite-dimensional algebras and resolutions relative to a generator-cogenerator. Furthermore, in the commutative ladder case, by a suitable modification of our interval approximation, we provide a formula linking the two conceptions of approximation.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Bipath Persistence as Zigzag Persistence

    math.AT 2024-12 conditional novelty 7.0 of 10

    Every bipath persistence module is determined by the barcode of a covering infinite zigzag module, yielding decomposition algorithms and algebraic stability for bipath persistence.

Pith tools