Let G be a graph on n vertices with adjacency matrix A, and let
1 be the...
We study Lindstrom quantifiers that satisfy certain closure properties w...
We prove that for any monotone class of finite relational structures, th...
Two graphs are cospectral if their respective adjacency matrices have th...
This note draws conclusions that arise by combining two recent papers, b...
Dawar and Wilsenach (ICALP 2020) introduce the model of symmetric arithm...
LREC= is an extension of first-order logic with a logarithmic recursion
...
Lovász (1967) showed that two finite relational structures A and B are
i...
We compare the capabilities of two approaches to approximating graph
iso...
Seese's conjecture for finite graphs states that monadic second-order lo...
It is well known that the classic Łoś-Tarski preservation theorem fails
...
Game comonads, introduced by Abramsky, Dawar and Wang and developed by
A...
We introduce symmetric arithmetic circuits, i.e. arithmetic circuits wit...
Gurevich (1988) conjectured that there is no logic for P or for
NP∩coNP....
The family of Weisfeiler-Leman equivalences on graphs is a widely studie...
Invertible map equivalences are approximations of graph isomorphism that...
We consider families of symmetric linear programs (LPs) that decide a
pr...
We describe a method for generating graphs that provide difficult exampl...
We consider the hardness of approximation of optimization problems from ...
Fixed-point logic with rank (FPR) is an extension of fixed-point logic w...