Showing 2025Show all
2 papers · 1 filter
quant-ph2025
Homomorphism Indistinguishability Relations induced by Quantum Groups
Tim Seppelt, Gian Luca Spitzer
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs. Two graphs and are called homomorphism indistinguishable over a g…
cs.LO2025
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Isolde Adler, Eva Fluck, Tim Seppelt +1
We study the expressive power of first-order logic with counting quantifiers, especially the -variable and quantifier-rank- fragment, using homomorphism indistinguishability.…