C2

We will introduce both the class of right-angled Artin groups (RAAG) and
the Nielsen realisation problem. Then we will discuss some recent progress
towards solving the problem.
 

A non-parametric test for dependence between sets of random variables based on the entropy rate is proposed. The test has correct size, unit asymptotic power, and can be applied to test setwise cross sectional and serial dependence. Using Monte Carlo experiments, we show that the test has favourable small-sample properties when compared to other tests for dependence. The ‘trick’ of the test relies on using universal codes to estimate the entropy rate of the stochastic process generating the data, and simulating the null distribution of the estimator through subsampling. This approach avoids having to estimate joint densities and therefore allows for large classes of dependence relationships to be tested. Potential economic applications include model specification, variable and lag selection, data mining, goodness-of-fit testing and measuring predictability.

We discuss kinematic algebras associated to the scattering equations that arise in the description of the scattering of massless particles.  We describe their role in the BCJ duality between colour and kinematics in gauge theory, and its relation to gravity. We find that the scattering equations are a consistency condition for a self-dual-type vertex and identify an extension of the anti-self-dual vertex, such that the two vertices are not conjugate in general. Both vertices correspond to the structure constants of Lie algebras. We give a prescription for the use of the generators of these Lie algebras in trivalent graphs that leads to a natural set of BCJ numerators. In particular, we write BCJ numerators for each contribution to the amplitude associated to a solution of the scattering equations. This leads to a decomposition of the determinant of a certain kinematic matrix, which appears naturally in the amplitudes, in terms of trivalent graphs. We also present the kinematic analogues of colour traces, according to these algebras, and the associated decomposition of that determinant.

We discuss kinematic algebras associated to the scattering equations that arise in the description of the scattering of massless particles.  We describe their role in the BCJ duality between colour and kinematics in gauge theory, and its relation to gravity. We find that the scattering equations are a consistency condition for a self-dual-type vertex and identify an extension of the anti-self-dual vertex, such that the two vertices are not conjugate in general. Both vertices correspond to the structure constants of Lie algebras. We give a prescription for the use of the generators of these Lie algebras in trivalent graphs that leads to a natural set of BCJ numerators. In particular, we write BCJ numerators for each contribution to the amplitude associated to a solution of the scattering equations. This leads to a decomposition of the determinant of a certain kinematic matrix, which appears naturally in the amplitudes, in terms of trivalent graphs. We also present the kinematic analogues of colour traces, according to these algebras, and the associated decomposition of that determinant.

We consider the parameter $a(H)$, which is the smallest a such that if $|E(G)|$ is at least/exceeds $a|V(H)|/2$ then $G$ has an $H$-minor. We are especially interested in sparse $H$ and in bounding $a(H)$ as a function of $|E(H)|$ and $|V(H)|$. This is joint work with David Wood.

Perfect matchings are fundamental objects of study in graph theory. There is a substantial classical theory, which cannot be directly generalised to hypergraphs unless P=NP, as it is NP-complete to determine whether a hypergraph has a perfect matching. On the other hand, the generalisation to hypergraphs is well-motivated, as many important problems can be recast in this framework, such as Ryser's conjecture on transversals in latin squares and the Erdos-Hanani conjecture on the existence of designs. We will discuss a characterisation of the perfect matching problem for uniform hypergraphs that satisfy certain density conditions (joint work with Richard Mycroft), and a polynomial time algorithm for determining whether such hypergraphs have a perfect matching (joint work with Fiachra Knox and Richard Mycroft).

An independent set in an $r$-uniform hypergraph is a subset of the vertices that contains no edges. A container for the independent set is a superset of it. It turns out to be desirable for many applications to find a small collection of containers, none of which is large, but which between them contain every independent set. ("Large" and "small" have reasonable meanings which will be explained.)

Applications include giving bounds on the list chromatic number of hypergraphs (including improving known bounds for graphs), counting the solutions to equations in Abelian groups, counting Sidon sets, establishing extremal properties of random graphs, etc.

The work is joint with David Saxton.