Metraipolis › archive › dc_e64b009932bd

A Simple Las Vegas Algorithm for Sparse Nonnegative Convolution — arXiv:2608.16123

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.16123
License (as archived)
CC0-1.0
Archived
2026-10-19T00:09:25.293Z
SHA-256 of the archived text
5e76070d97a34b6840201f5e77724776eed876214fc146be60ef6ea955c75ccf
Stable URL of this page
https://metraipolis.com/documento/dc_e64b009932bd

How to cite

A Simple Las Vegas Algorithm for Sparse Nonnegative Convolution — arXiv:2608.16123 — arXiv (en), https://arxiv.org/abs/2608.16123 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e64b009932bd (Metraipolis archive dc_e64b009932bd, sha256 5e76070d97a34b6840201f5e77724776eed876214fc146be60ef6ea955c75ccf)
BibTeX
@misc{dce64b009932bd,
  title = {A Simple Las Vegas Algorithm for Sparse Nonnegative Convolution — arXiv:2608.16123},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.16123},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e64b009932bd; sha256 5e76070d97a34b6840201f5e77724776eed876214fc146be60ef6ea955c75ccf},
  year = {2026}
}

Archived text

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

Let $A, B \in \mathbb{Z}_{\ge 0}^n$ be nonnegative vectors and let $t = |\operatorname{supp}(A \star B)|$. We give a Las Vegas algorithm that computes $A \star B$ in $O(t \log t)$ expected time. More generally, for every $0 < \delta \le \frac{1}{2}$, the algorithm terminates within $O(t \log t \log \frac{1}{\delta})$ time with probability at least $1 - \delta$. The algorithm uses dense convolution, linear hashing, and the length reduction of \cite{BFN22}. Its main ingredient is a carry-free representation of the indices as vectors of constant dimension $d$ whose coordinates have size $O(t / \log t)$. We can then take our hash function to be the inner product with a random element of $\mathbb{F}_p^d$ for a prime $p$ of size $\Omega(t / \log t)$: this preserves addition and gives collision probability exactly $1/p$, while identities regarding the moments of the vectors identify and recover the isolated terms as in \cite{BFN22}. Our expected running time matches that of Jin and Xu~\cite{JX24} while using substantially different tools and yielding a simpler algorithm. Note that their algorithm also terminates within $O(t \log t)$ time with probability at least $1 - \frac{1}{t}$, while our tail bound is weaker.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.16123 — 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-18T23:35:27.641Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).