Metraipolis › archive › dc_2fbfb23bc497
An upper bound on the number of relevant variables in a bounded degree Boolean function on the Hamming graph — arXiv:2609.12540
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.12540
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T03:49:21.227Z
- SHA-256 of the archived text
268ab80b6e563c9fd989b21865a4154243f9d746f770cbd41de76f493a41868a- Stable URL of this page
https://metraipolis.com/documento/dc_2fbfb23bc497
How to cite
An upper bound on the number of relevant variables in a bounded degree Boolean function on the Hamming graph — arXiv:2609.12540 — arXiv (en), https://arxiv.org/abs/2609.12540 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2fbfb23bc497 (Metraipolis archive dc_2fbfb23bc497, sha256 268ab80b6e563c9fd989b21865a4154243f9d746f770cbd41de76f493a41868a)
BibTeX
@misc{dc2fbfb23bc497,
title = {An upper bound on the number of relevant variables in a bounded degree Boolean function on the Hamming graph — arXiv:2609.12540},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.12540},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2fbfb23bc497; sha256 268ab80b6e563c9fd989b21865a4154243f9d746f770cbd41de76f493a41868a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.12540. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In this work, we prove that any Boolean function of degree $d$ on $\mathbb{Z}_{q}^n$, $q\geq 3$, has at most $m_qq^d$ relevant variables, where $m_q=\frac{2q(q^2+4q+1)}{(q-1)^4}$. For $q\in \{3,4,5,6,7\}$, we improve this bound to $2.854\cdot 3^d$, $1.749\cdot 4^d$, $1.263\cdot 5^d$, $0.994\cdot 6^d$, and $0.814\cdot 7^d$, respectively.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-14 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.12540 — 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-16T03:18:59.213Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).