Lovász-Type Theorems and Game Comonads

@article{Dawar2021LovszTypeTA,
  title={Lov{\'a}sz-Type Theorems and Game Comonads},
  author={A. Dawar and Tom'avs Jakl and Luca Reggio},
  journal={2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)},
  year={2021},
  pages={1-13}
}
Lovász (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after, Pultr (1973) proved a categorical generalisation of this fact. We propose a new categorical formulation, which applies to any locally finite category with pushouts and a proper factorisation system. As special cases of this general theorem, we obtain two variants… Expand

References

SHOWING 1-10 OF 30 REFERENCES
The pebbling comonad in Finite Model Theory
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs
  • L. Mancinska, D. Roberson
  • Physics, Computer Science
  • 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
  • 2020
Homomorphism preservation theorems
Comonadic semantics for guarded fragments
  • S. Abramsky, Dan Marsden
  • Computer Science, Mathematics
  • 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2021
FACTORIZATION SYSTEMS
Counting Bounded Tree Depth Homomorphisms
A Pebbling Comonad for Finite Rank and Variable Logic, and an Application to the Equirank-variable Homomorphism Preservation Theorem
  • T. Paine
  • Computer Science, Mathematics
  • MFPS
  • 2020
Fractional isomorphism of graphs
...
1
2
3
...