arXiv (All)
open access
Ornamentation lattices and intreeval hypergraphic lattices
Given a directed graph $D$ with transitive closure $\operatorname{tc}(D)$ and path hypergraph $\mathbb{P}(D)$, we study the connections between the (acyclic) reorientation poset of $\operatorname{tc}(D)$, the (acyclic) sourcing poset of $\mathbb{P}(D)$, and the (acyclic) ornamentation poset of $D$.
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
- An experimental study of forbidden patterns in geometric permutations by combinatorial lifting#311963
- Coding-Logic Correspondence: Turning Information and Communication Networks into Logical Formulae via Hypergraph Heyting Algebra#1013488
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#924894
- Bounded Twin-Width Tournaments are $\dchi$-Bounded#920660
- From pairs to patterns: combinatorial processes and relational reasoning in the processing of social relations#246881
Record · ID 1128511
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