The Satisfiability Threshold for k-XORSAT, using an alternative proof

arXiv1212.3822MaRDI QIDQ6238071FDOQ6238071

Gregory B. Sorkin, Boris Pittel

Publication date: 16 December 2012

Abstract: We consider "unconstrained" random $k$-XORSAT, which is a uniformly random system of $m$ linear non-homogeneous equations in $mathbb{F}_2$ over $n$ variables, each equation containing $kge3$ variables, and also consider a "constrained" model where every variable appears in at least two equations. Dubois and Mandler proved that $m/n=1$ is a sharp threshold for satisfiability of constrained 3-XORSAT, and analyzed the 2-core of a random 3-uniform hypergraph to extend this result to find the threshold for unconstrained 3-XORSAT. We show that $m/n=1$ remains a sharp threshold for satisfiability of constrained $k$-XORSAT for every $kge3$, and we use standard results on the 2-core of a random $k$-uniform hypergraph to extend this result to find the threshold for unconstrained $k$-XORSAT. For constrained $k$-XORSAT we narrow the phase transition window, showing that $n-moinfty$ implies almost-sure satisfiability, while $m-noinfty$ implies almost-sure unsatisfiability.

This page was built for publication: The Satisfiability Threshold for $k$-XORSAT, using an alternative proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6238071)