On the relative power of algebraic approximations of graph isomorphism

03/30/2021
by   Anuj Dawar, et al.
0

We compare the capabilities of two approaches to approximating graph isomorphism using linear algebraic methods: the invertible map tests (introduced by Dawar and Holm) and proof systems with algebraic rules, namely polynomial calculus, monomial calculus and Nullstellensatz calculus. In the case of fields of characteristic zero, these variants are all essentially equivalent to the the Weisfeiler-Leman algorithms. In positive characteristic we show that the invertible map method can simulate the monomial calculus and identify a potential way to extend this to the monomial calculus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2023

The algebraic λ-calculus is a conservative extension of the ordinary λ-calculus

The algebraic λ-calculus is an extension of the ordinary λ-calculus with...
research
12/16/2022

Call-By-Name Is Just Call-By-Value with Delimited Control

Delimited control operator shift0 exhibits versatile capabilities: it ca...
research
05/08/2017

Deterministic Genericity for Polynomial Ideals

We consider several notions of genericity appearing in algebraic geometr...
research
04/18/2019

Realizability in the Unitary Sphere

In this paper we present a semantics for a linear algebraic lambda-calcu...
research
10/01/2018

Handling Nominals and Inverse Roles using Algebraic Reasoning

This paper presents a novel SHOI tableau calculus which incorporates alg...
research
10/26/2021

Towards a Theory of Domains for Harmonic Functions and its Symbolic Counterpart

In this paper, we begin by reviewing the calculus induced by the framewo...
research
09/01/2022

A (Co)Algebraic Framework for Ordered Processes

A recently published paper (Schmid, Rozowski, Silva, and Rot, 2022) offe...

Please sign up or login with your details

Forgot password? Click here to reset