arXiv (All)
open access
Metric Poincaré type inequalities and lower bounds on the infimum of the spectrum for graphs
We study metric Poincaré type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants geometrically as diameters and inradii. Moreover, we can relate them
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
- RADIUS Attributes for Tunnel Protocol Support#139540
- Steiner graphical t -wise balanced designs of type nr#168758
- Plotkin-like Bound and Explicit Function-Correcting Code Constructions for Lee Metric Channels#177104
- Cisco Vendor-Specific RADIUS Attributes for the Delivery of Keying Material#213387
- A note on the equivalence of Gromov boundary and metric boundary#141640
Record · ID 1050711
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