Sacriston: towards a deeper understanding of place

In this report, we summarise the results of a small research project undertaken by researchers at UCL in conjunction with the Durham Miners’ Association, to explore social and economic change in the former mining village of Sacriston, supported by UCL Grand Challenges

Symmetric Instantons and Skyrme Fields

By explicit construction of the ADHM data, we prove the existence of a charge seven instanton with icosahedral symmetry. By computing the holonomy of this instanton we obtain a Skyrme field which approximates the minimal energy charge seven Skyrmion. We also present a one parameter family of tetrahedrally symmetric instantons whose holonomy gives a family of Skyrme fields which models a Skyrmion scattering process, where seven well-separated Skyrmions collide to form the icosahedrally symmetric Skyrmion.Comment: 22 pages plus 1 figure in GIF forma

Inversion symmetric 3-monopoles and the Atiyah-Hitchin manifold

We consider 3-monopoles symmetric under inversion symmetry. We show that the moduli space of these monopoles is an Atiyah-Hitchin submanifold of the 3-monopole moduli space. This allows what is known about 2-monopole dynamics to be translated into results about the dynamics of 3-monopoles. Using a numerical ADHMN construction we compute the monopole energy density at various points on two interesting geodesics. The first is a geodesic over the two-dimensional rounded cone submanifold corresponding to right angle scattering and the second is a closed geodesic for three orbiting monopoles.Comment: latex, 22 pages, 2 figures. To appear in Nonlinearit

First-Order Logic Theorem Proving and Model Building via Approximation and Instantiation

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The approximation extends the signature and preserves unsatisfiability: if the simplified clause set is satisfiable in some model, so is the original clause set in the same model interpreted in the original signature. A refutation generated by a decision procedure on the simplified clause set can then either be lifted to a refutation in the original clause set, or it guides a refinement excluding the previously found unliftable refutation. This way the approach is refutationally complete. We do not step-wise lift refutations but conflicting cores, finite unsatisfiable clause sets representing at least one refutation. The approach is dual to many existing approaches in the literature because our approximation preserves unsatisfiability

TOOLympics 2019: An Overview of Competitions in Formal Methods

Evaluation of scientific contributions can be done in many different ways. For the various research communities working on the verification of systems (software, hardware, or the underlying involved mechanisms), it is important to bring together the community and to compare the state of the art, in order to identify progress of and new challenges in the research area. Competitions are a suitable way to do that. The first verification competition was created in 1992 (SAT competition), shortly followed by the CASC competition in 1996. Since the year 2000, the number of dedicated verification competitions is steadily increasing. Many of these events now happen regularly, gathering researchers that would like to understand how well their research prototypes work in practice. Scientific results have to be reproducible, and powerful computers are becoming cheaper and cheaper, thus, these competitions are becoming an important means for advancing research in verification technology. TOOLympics 2019 is an event to celebrate the achievements of the various competitions, and to understand their commonalities and differences. This volume is dedicated to the presentation of the 16 competitions that joined TOOLympics as part of the celebration of the 25th anniversary of the TACAS conference