This dissertation contains various combinatorial results about games, graphs and finite Abelian groups. A linear configuration is said to be *common* in an Abelian group $G$ if every 2-colouring of $G$ yields at least as many monochromatic instances of the configuration as a randomly chosen colouring. In Chapter 2, we show that every configuration ...
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden patterns, does it allow an aperiodic tiling? The input may correspond to a subshift of finite type, a sofic subshi...
The generalized entropies of C. Tsallis and G. Kaniadakis have composition operations, which can be applied to the study of numbers. Here we will discuss these composition rules and use them to study some famous sequences of numbers (Mersenne, Fermat, Cullen, Woodall and Thabit numbers). We will also consider the sequence of the repunits, which can...
The design of decision procedures for combinations of theories sharing some arithmetic fragment is a challenging problem in verification. One possible solution is to apply a combination method à la Nelson-Oppen, like the one developed by Ghilardi for unions of non-disjoint theories. We show how to apply this non-disjoint combination method with the...
