Metraipolis › archive › dc_72f82e321a41

Upper Bounds for CSP Non-redundancy via Locally Decodable Codes — arXiv:2610.38664

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38664
License (as archived)
CC0-1.0
Archived
2026-11-01T02:38:15.047Z
SHA-256 of the archived text
a19a70a9d6dd8a1b5e0bb2f07d7127e19abc5dd9ab1a9ef447931aac2bbc87ac
Stable URL of this page
https://metraipolis.com/documento/dc_72f82e321a41

How to cite

Upper Bounds for CSP Non-redundancy via Locally Decodable Codes — arXiv:2610.38664 — arXiv (en), https://arxiv.org/abs/2610.38664 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_72f82e321a41 (Metraipolis archive dc_72f82e321a41, sha256 a19a70a9d6dd8a1b5e0bb2f07d7127e19abc5dd9ab1a9ef447931aac2bbc87ac)
BibTeX
@misc{dc72f82e321a41,
  title = {Upper Bounds for CSP Non-redundancy via Locally Decodable Codes — arXiv:2610.38664},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38664},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_72f82e321a41; sha256 a19a70a9d6dd8a1b5e0bb2f07d7127e19abc5dd9ab1a9ef447931aac2bbc87ac},
  year = {2026}
}

Archived text

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

In the study of constraint satisfaction problems (CSPs), the non-redundancy of a relation measures the maximum number of clauses in a CSP instance which can be logically independent. In the last few years, CSP non-redundancy has found a number of applications including in query complexity, sparsification, kernelization and streaming. In this paper, we present a novel technique for upper-bounding the non-redundancy of some relations using locally decodable codes (LDCs) and locally correctable codes (LCCs). More precisely, known limitations on the structure of 2-query LDCs and LCCs can be translated into limitations on the size of certain non-redundant CSP instances. This technique builds on a technique used by Brakensiek and Guruswami [STOC 2025] to bound non-redundancy via techniques from matching vector codes. Using LDCs and LCCs, we give improved upper bounds on non-redundancy of the BCK predicate pioneered by Bessiere, Carbonnel, and Katsirelos [AAAI 2020] as well as its well-studied Boolean variant. We also give the first example of a Boolean predicate whose non-redundancy is provably not of the form $n^{k\pm o(1)}$ for some positive integer $k$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Discrete Mathematics (cs.DM) ; Computational Complexity (cs.CC); Information Theory (cs.IT); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.38664 — 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-11-01T02:15:28.312Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).