AI Chat AI Image Generator AI Video Text to Speech

The k-XORSAT threshold revisited

01/23/2023

∙

by Amin Coja-Oghlan, et al.

∙

∙

We provide a simplified proof of the random k-XORSAT satisfiability threshold theorem. As an extension we also determine the full rank threshold for sparse random matrices over finite fields with precisely k non-zero entries per row. This complements a result from [Ayre, Coja-Oghlan, Gao, Müller: Combinatorica 2020]. The proof combines physics-inspired message passing arguments with a surgical moment computation.

Amin Coja-Oghlan
18 publications
Mihyun Kang
2 publications
Lena Krieg
3 publications
Maurice Rolvien
5 publications

page 1

page 2

page 3

page 4

research

∙ 06/13/2019

The rank of sparse random matrices

Generalising prior work on the rank of random matrices over finite field...

0 Amin Coja-Oghlan, et al. ∙

research

∙ 10/20/2017

The satisfiability threshold for random linear equations

Let A be a random m× n matrix over the finite field F_q with precisely k...

0 Peter Ayre, et al. ∙

research

∙ 10/17/2018

The rank of random matrices over finite fields

We determine the rank of a random matrix A over a finite field with pres...

0 Amin Coja-Oghlan, et al. ∙

research

∙ 05/18/2022

Sparse superposition codes with rotational invariant coding matrices for memoryless channels

We recently showed in [1] the superiority of certain structured coding m...

0 Yuhao Liu, et al. ∙

research

∙ 04/14/2018

The threshold for SDP-refutation of random regular NAE-3SAT

Unlike its cousin 3SAT, the NAE-3SAT (not-all-equal-3SAT) problem has th...

0 Yash Deshpande, et al. ∙

research

∙ 06/27/2022

Universality of Approximate Message Passing algorithms and tensor networks

Approximate Message Passing (AMP) algorithms provide a valuable tool for...

0 Tianhao Wang, et al. ∙