arXiv (All)
open access
Effective recurrence for computable measure-preserving transformations
We prove several necessary and sufficient conditions under which a point satisfies the Poincaré Recurrence Theorem for all computable (ergodic) measure-preserving transformations and all sets of a particular complexity. The necessary conditions are obtained by constructing specific measure-preservin
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
- On the existence of Markovian measures on continuous paths#1049853
- On the Dilation Theory and Canonical Decomposition of $\mathbfΘ_n$-Contractions#1141621
- A New Perspective on Diagonalization and Computability#709930
- Gromov-Hausdorff Convergence of Spectral Truncations for Noncommutative Tori#1156067
- Multiplicative recurrence of Piatetski--Shapiro and nil-Bohr sets#1155778
Record · ID 1000352
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