arXiv (All)
open access
Solutions to 6 problems in recurrence and Van der Corput sets
We present solutions to six problems concerning sets of nice recurrence and van der Corput (vdC) sets. We answer a question of Moreira, repeated by Fish and Skinner, by showing that every set of ergodic nice recurrence is a set of nice recurrence. We answer questions of Bergelson as well as Bergelso
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
- Constant-Probability Witness Isolation Implies $\mathrm{NP}\subseteq\mathrm{P/poly}$#1077231
- There exists a non-recursively enumerable set {n∈N: φ(n)} such that the formula φ(n) is short and can be easily translated into a first-order formula which uses only + and \cdot#119074
- Mathematical Recreations and Essays#43546
- Cross-Lingual Clinical Annotation Projection as Constrained Text Generation: A Six-Language Study#998979
- Differentiable Horn Programs: A Constructive Expressivity Theorem for Latent Rule Operators#973828
Record · ID 984423
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