Metraipolis › archive › dc_574fff9cea3c

Counting Residue-Class Survivor Sets: An Asymptotic Comparison with Prime-Admissible Sets — arXiv:2609.08528

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08528
License (as archived)
CC0-1.0
Archived
2026-10-16T14:49:28.293Z
SHA-256 of the archived text
7a362b4939146c493540adc11d08d6ac83a08e3677dcec028cf7864087753795
Stable URL of this page
https://metraipolis.com/documento/dc_574fff9cea3c

How to cite

Counting Residue-Class Survivor Sets: An Asymptotic Comparison with Prime-Admissible Sets — arXiv:2609.08528 — arXiv (en), https://arxiv.org/abs/2609.08528 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_574fff9cea3c (Metraipolis archive dc_574fff9cea3c, sha256 7a362b4939146c493540adc11d08d6ac83a08e3677dcec028cf7864087753795)
BibTeX
@misc{dc574fff9cea3c,
  title = {Counting Residue-Class Survivor Sets: An Asymptotic Comparison with Prime-Admissible Sets — arXiv:2609.08528},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08528},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_574fff9cea3c; sha256 7a362b4939146c493540adc11d08d6ac83a08e3677dcec028cf7864087753795},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08528. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For $n\geq1$, choose one residue class $r_k\pmod{k}$ for every $2\leq k\leq n$, and retain those $m\in\{2,\ldots,n+1\}$ for which $m\not\equiv r_k\pmod{k}$ whenever $k<m$. Let $N(n)$ be the number of distinct survivor sets obtained in this way. We prove \[ \log 2\leq \liminf_{n\to\infty}\frac{\log N(n)}{n/\log n} \leq \limsup_{n\to\infty}\frac{\log N(n)}{n/\log n} \leq2\log 2. \] If $A_{\rm adm}(n)$ denotes the number of subsets of $\{2,\ldots,n+1\}$ that omit at least one residue class modulo every prime, then our main comparison is \[ \log N(n)=\log A_{\rm adm}(n)+o\!\left(\frac{n}{\log n}\right). \] We also obtain an asymptotic formula for the number of distinct intersections of survivor sets with the primes, and an exact recurrence $N(n+1)=N(n)+E(n)$, where $E(n)$ counts the survivor sets that can be extended by the new point $n+2$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.08528 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.947Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).