Transfer-matrix methods meet Ehrhart theory

This paper investigates the joint enumeration problem with both parameters n and k free. We start off with the classical graph colorings and then explore common situations in combinatorics related to Ehrhart theory. We show how symmetries can be explored to reduce calculations and explain the interactions with Discrete Geometry.