Discrete dynamical systems can exhibit complex behavior from the iterative application of
straightforward local rules. A famous class of examples comes from cellular automata whose …

There are a number of well‐known problems and conjectures about partitioning graphs to
satisfy local constraints. For example, the majority colouring conjecture of Kreutzer, Oum …

We consider the problem of estimating the maximal energy of quantum $ p $-local spin glass
random Hamiltonians, the quantum analogues of widely studied classical spin glass models …

It is a folklore belief in the theory of spin glasses and disordered systems that out-of-
equilibrium dynamics fail to find stable local optima exhibiting eg local strict convexity on …

A set system is a collection of sets on an underlying universe of elements. It can be modeled
by a {0, 1} incidence matrix. The rows of the matrix represent sets, while the columns …

The central aim of this thesis is to study the concepts of" complexity" and" com-putational
capacity" of discrete dynamical systems and to connect them to rigorously measurable …