Combinatorics Group

Extremal combinatorics asks questions about the densest combinatorial structure satisfying a certain property. For example, what is the n-vertex graph with the most edges which does not contain a triangle? This particular question is not difficult to answer, but similar questions only slightly more complicated to state than this one can be fiendishly difficult - this area is a particular focus of group members  David Ellis and Robert Johnson. In addition to delicate combinatorial arguments, solutions to problems in extremal combinatorics may use tools from areas of mathematics such as representation theory and discrete Fourier analysis.

Instead of looking at extremal combinatorial structures one can study typical ones: this is the concern of Dudley Stark and Mark Walters, who study random structures. For example, suppose radio transceivers with limited range are randomly scattered over an area; what is the probability that they will be able to cooperate to send messages over long distances? Or, again, what is the distribution of certain small substructures in a large random structure, for example a large random graph? To solve problems in this area one needs to combine methods from probability theory with combinatorial insights.

The fields of Operational Research and Theoretical Computer Science have had a long relationship with Combinatorics. Felix Fischer’s research is concerned with problems that arise from the interaction of self-interested computationally bounded entities, or agents. His approach is mathematical and uses concepts and techniques from game theory, social choice, and mechanism design, from theoretical computer science, and from related areas of mathematics like optimization, probability theory, and graph theory. Mark Jerrum studies the complexity of counting problems, which even now contains some large relatively unexplored areas. A prominent emerging Leitmotiv here is the idea that phase transitions in a model in statistical physics may provably be associated with a sudden change in the complexity of computing the partition function (generating function of configurations) of the system. Justin Ward’s research involves the study and development of algorithms for combinatorial optimisation problems, with a focus on practical heuristics such as local search and greedy algorithms. His most recent work involves new frameworks for largescale and distributed submodular maximisation, as well as new algorithms for k-means clustering.

Consider a framework of bars of fixed length connected by universal joints that do not in any way constrain the angles between the bars, but which do constrain the ends of the bars to move together. Bill Jackson considers the question: when is such a framework rigid? Although geometry often plays a part in the theory of rigid frameworks, there is a general setting in which the answer to the above question is purely combinatorial, i.e., is dependent only on the incidences of the bars and joints. In these cases the rigidity of a framework is determined by a related combinatorial structure called a matroid.