Metraipolis › archive › dc_daa75a381c7b
Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds — arXiv:2609.25127
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.25127
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T15:55:44.209Z
- SHA-256 of the archived text
8fe29eb619990c27b81c6c9db54703f461df05c7267fcfc9038e7500d18b3234- Stable URL of this page
https://metraipolis.com/documento/dc_daa75a381c7b
How to cite
Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds — arXiv:2609.25127 — arXiv (en), https://arxiv.org/abs/2609.25127 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_daa75a381c7b (Metraipolis archive dc_daa75a381c7b, sha256 8fe29eb619990c27b81c6c9db54703f461df05c7267fcfc9038e7500d18b3234)
BibTeX
@misc{dcdaa75a381c7b,
title = {Stable Regularity Lemmas: Efficient Algorithms and Essentially Tight Littlestone Bounds — arXiv:2609.25127},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.25127},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_daa75a381c7b; sha256 8fe29eb619990c27b81c6c9db54703f461df05c7267fcfc9038e7500d18b3234},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.25127. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this paper, we determine the precise asymptotics of the number of parts of stable regularity equipartitions in terms of the Littlestone dimension: every graph $G$ of Littlestone dimension $\operatorname{Lit}(G)\leq\ell$ has a regular equipartition into excellent sets with $(1 + o_{\epsilon\to 0,\ell}(1))\cdot\epsilon^{-\ell-1}$ parts and in the other direction, for every $\ell\in\mathbb{N}_+$, there is an infinite family of graphs, all of Littlestone dimension $\ell$, whose equipartitions into good sets must have size at least $(1 + o_{\epsilon\to 0,\ell}(1))\cdot\epsilon^{-\ell-1}$. Dropping the equitability condition, we determine the asymptotics of non-equitable partitions up to a multiplicative $\log(1/\epsilon)$: every graph $G$ with $\operatorname{Lit}(G)\leq\ell$ has a regular partition into excellent sets with $(1 + o_{\epsilon\to 0,\ell}(1))\cdot\epsilon^{-\ell}\cdot\ln(1/\epsilon)$ parts and in the other direction, for every $\ell\in\mathbb{N}_+$, there is an infinite family of graphs, all of Littlestone dimension $\ell$, whose partitions into good sets must have size at least $(1 + o_{\epsilon\to 0,\ell}(1))\cdot\epsilon^{-\ell}$. We also show that such partition can be obtained algorithmically efficiently in an approximation scheme fashion: replacing the $o_{\epsilon\to 0,\ell}(1)$ term above by a constant $c > 0$, we obtain randomized $O_{c,\epsilon,\ell}(n\cdot\log(n))$-time algorithms for partitions/equipartitions into good sets, a deterministic $O_{c,\epsilon,\ell}(n^2)$-time algorithm for partitions into good sets, a deterministic $O_{c,\epsilon,\ell}(n^6)$-time algorithm for equipartitions into good sets, a deterministic $O_{c,\ell,\epsilon}(1)\cdot n^{O(\ell\cdot 2^{2\cdot\ell+4})}$-time algorithm for partitions/equipartitions into excellent sets, and $O_{c,\epsilon,\ell}(\log(n+1))$-space algorithms for partitions/equipartitions into good/excellent sets.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Data Structures and Algorithms (cs.DS); Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.25127 — 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-08T15:16:21.660Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).