Metraipolis › archive › dc_ee27dba69b91
Weak arcs and applications to the DNA-based storage access problem — arXiv:2608.19550
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.19550
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T12:00:44.953Z
- SHA-256 of the archived text
180960097476b847242f8ca54dea10ad7fcbf99332b9175694b4e54f00c2c7e3- Stable URL of this page
https://metraipolis.com/documento/dc_ee27dba69b91
How to cite
Weak arcs and applications to the DNA-based storage access problem — arXiv:2608.19550 — arXiv (en), https://arxiv.org/abs/2608.19550 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ee27dba69b91 (Metraipolis archive dc_ee27dba69b91, sha256 180960097476b847242f8ca54dea10ad7fcbf99332b9175694b4e54f00c2c7e3)
BibTeX
@misc{dcee27dba69b91,
title = {Weak arcs and applications to the DNA-based storage access problem — arXiv:2608.19550},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.19550},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ee27dba69b91; sha256 180960097476b847242f8ca54dea10ad7fcbf99332b9175694b4e54f00c2c7e3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19550. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Weak arcs are point sets in PG$(n-1,q)$ meeting every general hyperplane (those are the hyperplanes not going through one of the points given by the standard basis vectors) in at most $n-1$ points. In this paper, we study weak arcs together with balanced variants which are contained on the sides of the fundamental simplex. We give an upper bound on the size of weak arcs, characterise the largest balanced quasi-arcs in the plane and construct large balanced quasi-arcs in PG$(3, q)$. We then use these configurations to build point sets for the random-access problem in DNA-based storage. The constructions are explicit, work over small fields, and attain recovery expectations matching the best known asymptotic bounds. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-21 in math.IT). Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2608.19550 — 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-18T11:58:25.131Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).