arXiv (OAI Expanded)
open access
Generating Functions and the Entropy Hierarchy of Strongly Connected Digraphs
We present a generating-function approach to the topological entropy of finite strongly connected digraphs, working throughout with digraphs in which loops are allowed but multiple edges are excluded. Using dominant singularities of path-generating functions, we recover by new analytic--combinatoria
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
- Exact counting of unlabeled quartic graphs by permutation-cycle aggregation#1106106
- Generalizations of Pólya's theorem on random walks obtained via an extension of the symbolic method in enumerative combinatorics. I#1062639
- The ALQC Canon: Formalized Invariant Proof and Aevum Logic#72240
- Density of states of randomly sprinkled graphs#1123715
- Typical properties of countable graphs: flows and bridges#1064560
Record · ID 1123701
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