Graph cover problems form a critical area within discrete optimisation and theoretical computer science, addressing the challenge of selecting subsets of vertices (or edges) that satisfy predetermined ...

Consider a discrete group G and a bounded self-adjoint convolution operator T on l2 (G); let σ (T) be the spectrum of T. The spectral theorem gives a unitary isomorphism U between l2 (G) and a direct ...