arXiv (All)
open access
Transfer systems on trees and opposite posets
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 functio
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Clique Number of Tournaments II#984399
- Choice-Based Cardinal Utility. A Tribute to Patrick Suppes#754603
- Vaught's Conjecture for Sums of Products of Rooted Trees#1076262
- The gold partition conjecture and the Lexicographic sum of posets#1116075
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#924894
Record · ID 1115965
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive