arXiv (All)
open access
Counting pairs of saddle connections
We show that for almost every translation surface the number of pairs of saddle connections with bounded magnitude of the cross product has asymptotic growth like $c R^2$ where the constant $c$ depends only on the area and the connected component of the stratum. The proof techniques combine classica
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
- Counting pairs of saddle connections#783431
- Counting normals to closed curves in $\mathbb{R}^3$#1048571
- Counting integral points near a curve in the n-dimensional Euclidean space#798282
- Counting integral points near a curve in the n-dimensional Euclidean space#796869
- A Local Central Limit Theorem for Clique Counts in Sparse Random Graphs#625427
Record · ID 785021
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