Pith. sign in

REVIEW 1 cited by

A presentation of general multipersistence modules computable in polynomial time?

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 1210.1932 v2 pith:FBCHP7ZR submitted 2012-10-06 math.AT cs.CGmath.AC

Antonio Patriarca , Martina Scolamiero , Francesco Vaccarino This is my paper · ORCID
classification math.ATcs.CGmath.AC
keywords modulesalgorithmmultipersistencepolynomialbasescomputegeneralgroebner
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Multipersistence homology modules were introduced by G.Carlsson and A.Zomorodian which gave, together with G.Singh, an algorithm to compute their Groebner bases. Although their algorithm has polynomial complexity when the chain modules are free, i.e. in the one-critical case, it might be exponential in general. We give a new presentation of multipersistence homology modules, which allows us to design an algorithm to compute their Groebner bases always in polynomial time by avoiding the mapping telescope.

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. Modules over posets: commutative and homological algebra

    math.AC 2019-08 conditional novelty 8.0 of 10

    Tame modules over arbitrary posets are proved to have finite encodings, fringe presentations, indicator resolutions, and primary decompositions, leading to proofs of two sheaf-theoretic conjectures.

Pith tools