# A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs

arXiv: https://arxiv.org/abs/2204.10881 · HTML: https://mlsanity.com/paper/2204.10881/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 7 of its 33 references that are in the map.
- First posted on arXiv 20 Apr 2022.

## Builds on (most cited first, 7 of 7)

- [Non-backtracking spectrum of random graphs: community detection and non-regular Ramanujan graphs](https://mlsanity.com/paper/1501.06087/) (2015)
- [The Kikuchi Hierarchy and Tensor PCA](https://mlsanity.com/paper/1904.03858/) (2019)
- [Strongly Refuting Random CSPs Below the Spectral Threshold](https://mlsanity.com/paper/1605.00058/) (2016)
- [How to refute a random CSP](https://mlsanity.com/paper/1505.04383/) (2015)
- [Algorithms and Certificates for Boolean CSP Refutation: "Smoothed is no harder than Random"](https://mlsanity.com/paper/2109.04415/) (2021)
- [How Well Do Local Algorithms Solve Semidefinite Programs?](https://mlsanity.com/paper/1610.05350/) (2016)
- [Approximating Constraint Satisfaction Problems on High-Dimensional Expanders](https://mlsanity.com/paper/1907.07833/) (2019)

## Abstract (arXiv)

We define a novel notion of ``non-backtracking'' matrix associated to any symmetric matrix, and we prove a ``Ihara-Bass'' type formula for it. We use this theory to prove new results on polynomial-time strong refutations of random constraint satisfaction problems with k variables per constraints (k-CSPs). For a random k-CSP instance constructed out of a constraint that is satisfied by a p fraction of assignments, if the instance contains n variables and nk/2 / ε2 constraints, we can efficiently compute a certificate that the optimum satisfies at most a p+Ok(ε) fraction of constraints. Previously, this was known for even k, but for odd k one needed nk/2 (log n)O(1) / ε2 random constraints to achieve the same conclusion. Although the improvement is only polylogarithmic, it overcomes a significant barrier to these types of results. Strong refutation results based on current approaches construct a certificate that a certain matrix associated to the k-CSP instance is quasirandom. Such certificate can come from a Feige-Ofek type argument, from an application of Grothendieck's inequality, or from a spectral bound obtained with a trace argument. The first two approaches require a union bound that cannot work when the number of constraints is o(nlceil k/2 rceil) and the third one cannot work when the number of constraints is o(nk/2 √log n). We further apply our techniques to obtain a new PTAS finding assignments for k-CSP instances with nk/2 / ε2 constraints in the semi-random settings where the constraints are random, but the sign patterns are adversarial.