DeepAI
Log In Sign Up

Discrete density comonads and graph parameters

05/13/2022
by   Samson Abramsky, et al.
0

Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in terms of their Eilenberg-Moore coalgebras. As a result, a number of results from finite model theory, such as preservation theorems and homomorphism counting theorems, have been formalised and parameterised by comonads, giving rise to new results simply by varying the comonad. In this paper we study the limits of the comonadic approach in the combinatorial and homomorphism-counting aspect of the theory, regardless of whether any model comparison games are involved. We show that any standard graph parameter has a corresponding comonad, classifying the same class. This comonad is constructed via a simple Kan extension formula, making it the initial solution to this problem and, furthermore, automatically admitting a homomorphism-counting theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/15/2022

Structure and Power: an emerging landscape

In this paper, we give an overview of some recent work on applying tools...
10/24/2017

Counting small subgraphs in multi-layer networks

Motivated by the prevalence of multi-layer network structures in biologi...
07/23/2022

Constructive comparison in bidding combinatorial games

A class of discrete Bidding Combinatorial Games that generalize alternat...
10/21/2021

Polyadic Sets and Homomorphism Counting

A classical result due to Lovasz (1967) shows that the isomorphism type ...
06/12/2015

New Results for Domineering from Combinatorial Game Theory Endgame Databases

We have constructed endgame databases for all single-component positions...
10/19/2020

On the Robustness of Winners: Counting Briberies in Elections

We study the parameterized complexity of counting variants of Swap- and ...
01/16/2014

Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects

We present a method for using standard techniques from satisfiability ch...