{
  "abstract": "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$.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2610.38664",
  "author_total": 7,
  "authors": [
    {
      "name": "Joshua Brakensiek"
    },
    {
      "name": "David Conlon"
    },
    {
      "name": "Venkatesan Guruswami"
    },
    {
      "name": "Xiaoyu He"
    },
    {
      "name": "Jiaxi Nie"
    },
    {
      "name": "Maya Sankar"
    },
    {
      "name": "Hung-Hsun Hans Yu"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/b8710ama6w32n.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2610.38664",
  "fulltext_url": null,
  "id": "b8710ama6w32n",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2610.38664",
  "language": null,
  "licence": "LicenseRef-arXiv-nonexclusive-1.0",
  "licence_label": "arXiv licence",
  "licence_source": "article",
  "licence_url": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.CC"
    ],
    [
      "arxiv",
      "cs.DM"
    ],
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "math.CO"
    ],
    [
      "arxiv",
      "math.IT"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://arxiv.org/pdf/2610.38664",
  "pmcid": null,
  "pmid": null,
  "published": "2026-10-28",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/b8710ama6w32n.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:36:32Z",
      "native_id": "2610.38664",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2610.38664"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.CO",
      "subfield": "combinatorics"
    }
  ],
  "title": "Upper Bounds for CSP Non-redundancy via Locally Decodable Codes",
  "title_text": "Upper Bounds for CSP Non-redundancy via Locally Decodable Codes",
  "type": "preprint",
  "updated_at": "2026-11-01T12:20:50Z",
  "url": "https://research.draconitic.com/paper/b8710ama6w32n",
  "venue": "arXiv",
  "versions": []
}