AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (274.1 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

N d -Indexed persistence modules, higher dimensional partitions and rank invariants

Mehdi NateghZhenbo Qin( )Shuguang Wang
Department of Mathematics, University of Missouri, Columbia, MO 65211, USA
Show Author Information

Abstract

We study decomposable N d -indexed persistence modules via higher dimensional partitions. Their barcodes are defined in terms of the extended interior of the corresponding Young diagrams. For two decomposable N d -indexed persistence modules, we present a necessary and sufficient condition, in terms of the partitions, for their rank invariants to be the same. This generalizes the well-known fact that for an N -indexed persistence module, its barcode and its rank invariant determine each other, i.e., the rank invariant is a complete invariant.

CLC number: 05A17, 14C05, 55N31

References

【1】
【1】
 
 
AIMS Mathematics
Pages 25589-25605

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Nategh M, Qin Z, Wang S. N d -Indexed persistence modules, higher dimensional partitions and rank invariants. AIMS Mathematics, 2025, 10(11): 25589-25605. https://doi.org/10.3934/math.20251133

92

Views

5

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 07 July 2025
Revised: 16 October 2025
Accepted: 24 October 2025
Published: 06 November 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)