Log In Sign Up

Limitations of the Invertible-Map Equivalences

by   Anuj Dawar, et al.

This note draws conclusions that arise by combining two recent papers, by Anuj Dawar, Erich Grädel, and Wied Pakusa, published at ICALP 2019 and by Moritz Lichter, published at LICS 2021. In both papers, the main technical results rely on the combinatorial and algebraic analysis of the invertible-map equivalences ≡^IM_k,Q on certain variants of Cai-Fürer-Immerman (CFI) structures. These ≡^IM_k,Q-equivalences, for a natural number k and a set of primes Q, refine the well-known Weisfeiler-Leman equivalences used in algorithms for graph isomorphism. The intuition is that two graphs G ≡^IM_k,Q H cannot be distinguished by iterative refinements of equivalences on k-tuples defined via linear operators on vector spaces over fields of characteristic p ∈ Q. In the first paper it has been shown that for a prime q ∉ Q, the ≡^IM_k,Q equivalences are not strong enough to distinguish between non-isomorphic CFI-structures over the field 𝔽_q. In the second paper, a similar but not identical construction for CFI-structures over the rings ℤ_2^i has been shown to be indistinguishable with respect to ≡^IM_k,{2}. Together with earlier work on rank logic, this second result suffices to separate rank logic from polynomial time. We show here that the two approaches can be unified to prove that CFI-structures over the rings ℤ_2^i are indistinguishable with respect to ≡^IM_k,ℙ, for the set ℙ of all primes. This implies the following two results. 1. There is no fixed k such that the invertible-map equivalence ≡^IM_k,ℙ coincides with isomorphism on all finite graphs. 2. No extension of fixed-point logic by linear-algebraic operators over fields can capture polynomial time.


page 1

page 2

page 3

page 4


Approximations of Isomorphism and Logics with Linear-Algebraic Operators

Invertible map equivalences are approximations of graph isomorphism that...

Separating Rank Logic from Polynomial Time

In the search for a logic capturing polynomial time the most promising c...

Deep Weisfeiler Leman

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...

Insignificant Choice Polynomial Time

In the late 1980s Gurevich conjectured that there is no logic capturing ...

Capturing Polynomial Time using Modular Decomposition

The question of whether there is a logic that captures polynomial time i...

Choiceless Polynomial Time with Witnessed Symmetric Choice

We extend Choiceless Polynomial Time (CPT), the currently only remaining...

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

At the core of the quest for a logic for PTime is a mismatch between alg...