Metraipolis › archive › dc_bd7bcc680713
Certificate Complexity of Elementary Symmetric Boolean Functions of Arbitrary Degree — arXiv:2609.15678
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.15678
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:25:33.286Z
- SHA-256 of the archived text
773a024c79072cf45c74e6aadda5ab648cea6e74c889f8fc051b7e85dcf6a000- Stable URL of this page
https://metraipolis.com/documento/dc_bd7bcc680713
How to cite
Certificate Complexity of Elementary Symmetric Boolean Functions of Arbitrary Degree — arXiv:2609.15678 — arXiv (en), https://arxiv.org/abs/2609.15678 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd7bcc680713 (Metraipolis archive dc_bd7bcc680713, sha256 773a024c79072cf45c74e6aadda5ab648cea6e74c889f8fc051b7e85dcf6a000)
BibTeX
@misc{dcbd7bcc680713,
title = {Certificate Complexity of Elementary Symmetric Boolean Functions of Arbitrary Degree — arXiv:2609.15678},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.15678},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd7bcc680713; sha256 773a024c79072cf45c74e6aadda5ab648cea6e74c889f8fc051b7e85dcf6a000},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.15678. 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$. Previous work determined $C(\sigma_{n,d})$ when $d$ is odd or a power of two, but the general even non-power-of-two case remained open. We determine the certificate complexity for every degree $1\le d\le n$, thereby completing the classification for elementary symmetric Boolean functions. Writing $d=2^t m$ with $m$ odd, we obtain an explicit formula in which the possible deficit from the maximal value $n$ is controlled by $2^t$, while the exact value is determined by a binary containment condition involving $m$. In particular, \[ n-2^{\nu_2(d)}+1\le C(\sigma_{n,d})\le n, \] and we characterize when the upper bound is attained. Moreover, we determine the least positive period of the certificate-complexity deficit $\Delta_d(n)=n-C(\sigma_{n,d})$: it is $1$ for odd $d$, equals $d$ when $d$ is a power of two, and equals $2^{\lfloor\log_2 d\rfloor+1}$ for even non-power-of-two $d$. This least-period problem is distinct from the classical periodicity of the underlying value sequence $\binom{j}{d}\bmod 2$. The known odd-degree and power-of-two formulas are recovered as special cases.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Combinatorics (math.CO) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.15678 — 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-16T00:39:30.253Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).