Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 33 min ago
PreprintarXiv licencearXiv

Transfer systems on trees and opposite posets

  • Andrew Fargo
  • Christy Hazel
  • Deven Platt
Open at sourcePDFDOICite

Abstract

We study transfer systems on partially ordered sets whose Hasse diagrams are rooted trees. We prove there is a bijection between transfer systems on a tree and order-preserving functions to the natural numbers that are bounded by the rank function. We then develop a recurrence for the set of functions and use this to enumerate transfer systems on some families of trees. In addition to our study of trees, we prove for any finite poset 𝒫, the lattice of transfer systems on the opposite poset 𝒫op is isomorphic to the opposite lattice of transfer systems on 𝒫. We show this by establishing a bijection between weak factorization systems and transfer systems, which builds on the results for lattices shown in previous work of Franchere, Ormsby, Osorno, Qin, and Waugh.

Related

  1. The opposite of admissibility for local systems on line arrangements
    Robert Harris
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Universality in random graphs via optimal linking systems: trees and beyond
    Asaf Cohen Antonir, Lyuben Lichev, Maksim Zhukovskii
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsProbabilityarXiv
  3. Global transfer systems and endopurity of subgroups
    Scott Balchin, Miguel Barrero
    arXivPreprintarXiv licenceFull textAlgebra & number theoryGeometry & topologyarXiv
  4. Stability Transfer for Autonomous Systems via Higher-Order Taylor-Truncated Lyapunov Certificates
    Jose D. Hoyos, Zehui Lu, Shaoshuai Mou
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Model-based computational study of reactive fluid systems using transfer operator methods
    Anja Göbel, Anna Klünker, Alexandra von Kameke +1
    arXivPreprintCC BY 4.0Full textDynamical systemsComputational physicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{fargo2026transfer,
  title = {{Transfer systems on trees and opposite posets}},
  author = {Andrew Fargo and Christy Hazel and Deven Platt},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.32009},
  eprint = {2609.32009},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.32009},
}
RIS
TY  - UNPB
TI  - Transfer systems on trees and opposite posets
AU  - Andrew Fargo
AU  - Christy Hazel
AU  - Deven Platt
PY  - 2026
DA  - 2026/09/25
PB  - arXiv
DO  - 10.48550/arxiv.2609.32009
UR  - https://arxiv.org/abs/2609.32009
AB  - We study transfer systems on partially ordered sets whose Hasse diagrams are rooted trees. We prove there is a bijection between transfer systems on a tree and order-preserving functions to the natural numbers that are bounded by the rank function. We then develop a recurrence for the set of functions and use this to enumerate transfer systems on some families of trees. In addition to our study of trees, we prove for any finite poset 𝒫, the lattice of transfer systems on the opposite poset 𝒫^op is isomorphic to the opposite lattice of transfer systems on 𝒫. We show this by establishing a bijection between weak factorization systems and transfer systems, which builds on the results for lattices shown in previous work of Franchere, Ormsby, Osorno, Qin, and Waugh.
ER  -