Metraipolis › archive › dc_500b0ede46cc
Derived equivalences between diagram categories of finite posets — arXiv:2609.10110
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10110
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:19:06.553Z
- SHA-256 of the archived text
175ceb06343620e3c2a144a74fc253f9b453aca9a483a69a546e484d3e99066b- Stable URL of this page
https://metraipolis.com/documento/dc_500b0ede46cc
How to cite
Derived equivalences between diagram categories of finite posets — arXiv:2609.10110 — arXiv (en), https://arxiv.org/abs/2609.10110 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_500b0ede46cc (Metraipolis archive dc_500b0ede46cc, sha256 175ceb06343620e3c2a144a74fc253f9b453aca9a483a69a546e484d3e99066b)
BibTeX
@misc{dc500b0ede46cc,
title = {Derived equivalences between diagram categories of finite posets — arXiv:2609.10110},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10110},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_500b0ede46cc; sha256 175ceb06343620e3c2a144a74fc253f9b453aca9a483a69a546e484d3e99066b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10110. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study universal derived equivalences between diagram categories indexed by finite posets. Starting from a construction of Ladkani, we give an intrinsic criterion for determining when a finite poset admits a decomposition to which this construction can be applied. This leads to the notion of an admissible cut, formulated entirely in terms of the order structure of the poset. Our main result therefore provides a method for producing, from a given finite poset admitting such a cut, a new poset that is universally derived equivalent to it. The construction is reversible once the partition is retained, so that the original mixed order relations can be recovered from the transformed poset. As applications, we show that every finite poset of height at most one is universally derived equivalent to its opposite, give a criterion characterizing source-to-sink transformations at minimal elements, and recover the universal derived equivalence of all orientations of a finite tree through sequences of such local transformations. These results are also applied to persistence modules indexed by finite posets and to extensions obtained by adjoining further finite parameters. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.CO). Categorie arXiv: Representation Theory (math.RT) ; Combinatorics (math.CO); Category Theory (math.CT). Pagina del lavoro: https://arxiv.org/abs/2609.10110 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T08:47:06.328Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).