Pebble Games and Linear Equations

@article{Grohe2012PebbleGA,
  title={Pebble Games and Linear Equations},
  author={M. Grohe and M. Otto},
  journal={ArXiv},
  year={2012},
  volume={abs/1204.1990}
}
  • M. Grohe, M. Otto
  • Published 2012
  • Mathematics, Computer Science
  • ArXiv
  • We give a new, simplified and detailed account of the correspondence between levels of the Sherali-Adams relaxation of graph isomorphism and levels of pebble-game equivalence with counting (higher-dimensional Weisfeiler-Lehman colour refinement). The correspondence between basic colour refinement and fractional isomorphism, due to Ramana, Scheinerman and Ullman, is re-interpreted as the base level of Sherali-Adams and generalised to higher levels in this sense by Atserias and Maneva, who… CONTINUE READING
    42 Citations
    Sherali-Adams relaxations and indistinguishability in counting logics
    • 53
    • PDF
    ADAMS RELAXATIONS AND INDISTINGUISHABILITY IN COUNTING LOGICS
    • 1
    • PDF
    Lovász Meets Weisfeiler and Leman
    • 20
    • PDF
    Linear Diophantine Equations, Group CSPs, and Graph Isomorphism
    • 5
    • PDF
    Approximations of Isomorphism and Logics with Linear-Algebraic Operators
    • 5
    • PDF
    Quantum and non-signalling graph isomorphisms
    • 39
    • PDF
    Graph Isomorphism, Color Refinement, and Compactness
    • 15
    • PDF
    Descriptive complexity of linear equation systems and applications to propositional proof complexity
    • M. Grohe, Wied Pakusa
    • Computer Science
    • 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
    • 2017
    • 12
    • PDF

    References

    SHOWING 1-10 OF 28 REFERENCES
    Sherali-Adams relaxations and indistinguishability in counting logics
    • 53
    • PDF
    Sherali-Adams relaxations of graph isomorphism polytopes
    • P. N. Malkin
    • Mathematics, Computer Science
    • Discret. Optim.
    • 2014
    • 29
    • PDF
    Sherali-adams relaxations of the matching polytope
    • 43
    • PDF
    Upper and lower bounds for first order expressibility
    • N. Immerman
    • Mathematics, Computer Science
    • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
    • 1980
    • 251
    • PDF
    Tree-width and the Sherali-Adams operator
    • 40
    • PDF
    Integrality gaps for Sherali-Adams relaxations
    • 126
    • PDF
    Fixed-Point Definability and Polynomial Time on Graphs with Excluded Minors
    • M. Grohe
    • Mathematics, Computer Science
    • 2010 25th Annual IEEE Symposium on Logic in Computer Science
    • 2010
    • 69
    On Finite Model Theory
    • 409
    Rank Bounds and Integrality Gaps for Cutting Planes Procedures
    • 75
    • PDF
    Fractional isomorphism of graphs
    • 49