arXiv (OAI Expanded)
open access
Groupoids of finitely aligned higher-rank graphs via filters and graph morphisms
Higher-rank graphs are certain small categories that are a higher-dimensional generalisation of both directed graphs and free monoids. Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphi
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
- There are no nontrivial chordal square-complementary graphs#1076358
- A Chain- and Diagram-Level Semantics for Morphological Calculus Refinement, monodromy, and bivector orbit decompositions#677729
- A Metric of Species’ Charisma#1038668
- Pretorsion theories in prenormal categories#254378
- Allegorical Figure Group: The Arts#498234
Record · ID 1069675
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