arXiv (All)
open access
Magnitude and motivic zeta functions of matroids
We prove that the magnitude of the tope graph of a simple oriented matroid is the specialization at $x=-1$ of the motivic zeta function of its underlying matroid. This refines the Las Vergnas--Zaslavsky theorem and defines magnitude for arbitrary matroids. For simple orientable matroids, we compute
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 inequality for the number of independent sets of matroids with an application to the forest-tree ratio of graphs#1012787
- On prime coprime graphs of certain finite groups#1116117
- Clique covers and decompositions of cliques of graphs#1122901
- On the Burning Game: Nordhaus-Gaddum Bounds and Graph Products#1142856
- A dimer view on Fox's trapezoidal conjecture#785096
Record · ID 985381
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