# 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

- Computer Science, Mathematics
- 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2017

It is shown that existential k-pebble games have a natural comonadic formulation and lays the basis for some new and promising connections between two areas within logic in computer science which have largely been disjoint: finite and algorithmic model theory, and semantics and categorical structures of computation. Expand

Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs

- Computer Science, Physics
- 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS)
- 2020

This combinatorial proof leverages the quantum automorphism group of a graph, a notion from noncommutative mathematics, and shows that homomorphism counts from graphs of bounded treewidth do not determine a graph up to isomorphism. Expand

Relating Structure and Power: Comonadic Semantics for Computational Resources

- Computer Science
- CSL
- 2018

The results pave the way for systematic connections between two major branches of the field of logic in computer science which hitherto have been almost disjoint: categorical semantics, and finite and algorithmic model theory. Expand

Homomorphism preservation theorems

- Mathematics, Computer Science
- JACM
- 2008

It is proved that the h.p.t. remains valid when restricted to finite structures (unlike many other classical preservation theorems, including the Łoś--Tarski theorem and Lyndon's positivity theorem). Expand

The Weisfeiler-Leman Algorithm: An Exploration of its Power

- 2021

Some of my favorite open problems concern fixed-point logic with counting, FPC. It is known that counting logic with k + 1 variables, Ck+1, has exactly the same expressive power as the classic… Expand

Comonadic semantics for guarded fragments

- Computer Science, Mathematics
- 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
- 2021

A systematic account of how a range of model comparison games which play a central role in finite model theory can be captured in terms of resource-indexed comonads on the category of relational structures, including Ehrenfeucht-Fraïssé, pebbling, and bisimulation games, is extended to quantifier-guarded fragments of first-order logic. Expand

∞-Categories for the Working Mathematician

- 2018

homotopy theory C.1. Lifting properties, weak factorization systems, and Leibniz closure C.1.1. Lemma. Any class of maps characterized by a right lifting property is closed under composition,… Expand

FACTORIZATION SYSTEMS

- 2008

These notes were written to accompany a talk given in the Algebraic Topology and Category Theory Proseminar in Fall 2008 at the University of Chicago. We first introduce orthogonal factorization… Expand

Counting Bounded Tree Depth Homomorphisms

- Computer Science, Mathematics
- LICS
- 2020

We prove that graphs G, G' satisfy the same sentences of first-order logic with counting of quantifier rank at most k if and only if they are homomorphism-indistinguishable over the class of all… Expand

A Pebbling Comonad for Finite Rank and Variable Logic, and an Application to the Equirank-variable Homomorphism Preservation Theorem

- Computer Science, Mathematics
- MFPS
- 2020

Abstract In this paper we recast the proof of Rossman's equirank homomorphism preservation theorem using comonadic formulations of bounded quantifier rank and variable count (and dually tree width… Expand