Determinants from homomorphisms

04/22/2022
by   Radu Curticapean, et al.
0

We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new explanation avoids linear-algebraic arguments and instead exploits a classical connection between subgraph and homomorphism counts.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/22/2020

FPT-space Graph Kernelizations

Let n be the size of a parametrized problem and k the parameter. We pres...
research
11/02/2022

A Note on the Ramanujan Machine

The Ramanujan Machine project detects new expressions related to constan...
research
05/08/2023

Count on CFI graphs for #P-hardness

Given graphs H and G, possibly with vertex-colors, a homomorphism is a f...
research
07/15/2021

An Efficient Semi-Streaming PTAS for Tournament Feedback ArcSet with Few Passes

We present the first semi-streaming PTAS for the minimum feedback arc se...
research
03/19/2021

A systematic association of subgraph counts over a network

We associate all small subgraph counting problems with a systematic grap...
research
07/02/2020

Parallel Planar Subgraph Isomorphism and Vertex Connectivity

We present the first parallel fixed-parameter algorithm for subgraph iso...

Please sign up or login with your details

Forgot password? Click here to reset