On Homomorphism Indistinguishability and Hypertree Depth

Benjamin Scheidt

$G{C}^k$ is a logic introduced by Scheidt and Schweikardt (2023) to express properties of hypergraphs. It is similar to first-order logic with counting quantifiers ($C$) adapted to t…