arXiv (All)
open access
Density of large holes among power-free lattice points
For fixed integers $d,r\ge1$ with $dr\ge2$, the $r$-free points of $\mathbb{Z}^d$ are the vectors whose coordinate gcd is not divisible by the $r$th power of any prime. We consider the set $W_{d,r}$ of non-$r$-free points in $\mathbb{Z}^d$ as the vertex set of a graph with nearest-neighbour adjacenc
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
- Largest Circle Enclosing Exactly $n$ Interior Lattice Points. II#1110470
- The coarse Erdős-Pósa theorem#1077343
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
- A cyclic non-Ramsey heptagon#1049070
- Fan-goodness of sparse graphs#1014529
Record · ID 1061097
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