{
  "id": "1212.1905",
  "version": "v2",
  "published": "2012-12-09T17:21:12.000Z",
  "updated": "2014-08-03T22:30:30.000Z",
  "title": "The Satisfiability Threshold for k-XORSAT",
  "authors": [
    "Boris Pittel",
    "Gregory B. Sorkin"
  ],
  "comment": "Version 2 adds sharper phase transition result, new citation in literature survey, and improvements in presentation; removes Appendix treating k=3",
  "categories": [
    "math.CO",
    "math.PR"
  ],
  "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 $k \\geq 3$ 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 $k\\ge 3$, 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 $m-n \\to -\\infty$ implies almost-sure satisfiability, while $m-n \\to +\\infty$ implies almost-sure unsatisfiability.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2014-08-03T22:30:30.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "satisfiability threshold",
      "sharp threshold",
      "phase transition window",
      "implies almost-sure satisfiability",
      "implies almost-sure unsatisfiability"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1212.1905P"
    }
  }
}