Metraipolis › archive › dc_bdede0fc6413
Sensitivity and Block Sensitivity of Elementary Symmetric Boolean Functions of Arbitrary Degree — arXiv:2609.23781
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.23781
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T21:44:54.294Z
- SHA-256 of the archived text
3d6a9b81e05e444379b126f11e10e9d0c0c87b134018f437128d84f9b675ed22- Stable URL of this page
https://metraipolis.com/documento/dc_bdede0fc6413
How to cite
Sensitivity and Block Sensitivity of Elementary Symmetric Boolean Functions of Arbitrary Degree — arXiv:2609.23781 — arXiv (en), https://arxiv.org/abs/2609.23781 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bdede0fc6413 (Metraipolis archive dc_bdede0fc6413, sha256 3d6a9b81e05e444379b126f11e10e9d0c0c87b134018f437128d84f9b675ed22)
BibTeX
@misc{dcbdede0fc6413,
title = {Sensitivity and Block Sensitivity of Elementary Symmetric Boolean Functions of Arbitrary Degree — arXiv:2609.23781},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.23781},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bdede0fc6413; sha256 3d6a9b81e05e444379b126f11e10e9d0c0c87b134018f437128d84f9b675ed22},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.23781. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $\sigma_{n,d}$ denote the elementary symmetric Boolean function of $n$ variables and degree $d$. We completely determine the sensitivity, average sensitivity, and block sensitivity of $\sigma_{n,d}$ for every $1\le d\le n$. Using Lucas' theorem, we obtain a uniform binary description of the Hamming-weight value sequence, from which the sensitivity and average-sensitivity formulas follow and the computation of block sensitivity reduces to at most four explicit candidates. Combining these results with the arbitrary-degree formula for certificate complexity, we determine the exact relations among sensitivity, block sensitivity, and certificate complexity. We also prove a general result for symmetric Boolean functions: every nonconstant symmetric Boolean function $f$ satisfies \[ \bs(f)\le \max\{s(f),C(f)-1\}. \] Consequently, only the three patterns \[ s=\bs=C,\qquad s=\bs<C,\qquad s<\bs<C \] can occur for nonconstant symmetric Boolean functions. For elementary symmetric Boolean functions, we give necessary and sufficient conditions for each of these three patterns, thereby completely classifying the relations among $s(\sigma_{n,d})$, $\bs(\sigma_{n,d})$, and $C(\sigma_{n,d})$. In particular, we obtain a necessary and sufficient characterization of the full strict hierarchy \[ s(\sigma_{n,d})<\bs(\sigma_{n,d})<C(\sigma_{n,d}), \] and exhibit infinite families for which it holds.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-22 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.23781 — 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-09T21:26:41.133Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-22?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).