I will describe recent advances in the study of quantum gravity where one can explicitly show in examples that superpositions of states with fixed topology can change the topology of spacetime. These effects lead to paradoxes that are resolved in effective field theory by the introduction of code subspaces. I will also talk about more typical states and issues related on how to decide if a black hole horizon is smooth or not.

In 1983, Erdos and Szemerédi conjectured that for any finite subset of the integers, either the sumset or the product set has nearly quadratic growth. Applications include incidence geometry, exponential sums, compressed image sensing, computer science, and elsewhere. We discuss recent progress towards the main conjecture and related questions. 

Leighton's Theorem states that if two finite graphs have a common universal cover then they have a common finite cover. I will present a new proof of this using groupoids, and then talk about two generalisations of the theorem that can also be tackled with this groupoid approach: one gives us control over the local structure of the common finite cover, and the other deals with graphs of spaces.

I will present a survey of commonly considered notions of negative curvature for groups, focused on generalising properties of Gromov hyperbolic groups.

The time bottleneck in the manufacturing process of Besi (company involved in ESGI 149 Innsbruck) is the extraction of undamaged dies from a component wafer. The easiest way for them to speed up this process is to reduce the number of 'selections' made by the robotic arm.  Each 'selection' made by this robotic arm can be thought of as choosing a 2x2 submatix of a large binary matrix, and editing the 1's in this submatrix to be 0's.  The quesiton is: what is the fewest number of 2x2 submatrices required to cover the full matrix, and how can we find this number. This problem can be solved exactly using integer programming methods, although this approach proves to be prohibitively expensive for realistic sizes. In this talk I will describe the approach taken by my team at EGSI 149, as well as directions for further improvement.

ACORN generators represents an approach to generating uniformly distributed pseudo-random numbers which is straightforward to implement for arbitrarily large order $k$ and modulus $M=2^{30t}$ (integer $t$). They give long period sequences which can be proven theoretically to approximate to uniformity in up to $k$ dimensions, while empirical statistical testing demonstrates that (with a few very simple constraints on the choice of parameters and the initialisation) the resulting sequences can be expected to pass all the current standard tests .

The standard TestU01 Crush and BigCrush Statistical Test Suites are used to demonstrate for ACORN generators with order $8≤k≤25$ that the statistical performance improves as the modulus increases from $2^{60}$ to $2^{120}$. With $M=2^{120}$ and $k≥9$, it appears that ACORN generators pass all the current TestU01 tests over a wide range of initialisations; results are presented that demonstrate the remarkable consistency of these results, and explore the limits of this behaviour.

This contrasts with corresponding results obtained for the widely-used Mersenne Twister MT19937 generator, which consistently failed on two of the tests in both the Crush and BigCrush test suites.

There are other pseudo-random number generators available which will also pass all the TestU01 tests. However, for the ACORN generators it is possible to go further: we assert that an ACORN generator might also be expected to pass any more demanding tests for $p$-dimensional uniformity that may be required in the future, simply by choosing the order $k>p$, the modulus $M=2^{30t}$ for sufficiently large $t$, together with any odd value for the seed and an arbitrary set of initial values. We note that there will be $M/2$ possible odd values for the seed, with each such choice of seed giving rise to a different $k$-th order ACORN sequence satisfying all the required tests.

This talk builds on and extends results presented at the recent discussion meeting on “Numerical algorithms for high-performance computational science” at the Royal Society London, 8-9 April 2019, see download link at bottom of web page http://acorn.wikramaratna.org/references.html.

I will give an introduction to the theory of definable parameterization of definable sets in the o-minimal context and its application to diophantine problems. I will then go on to discuss uniformity issues with particular reference to the subanalytic case. This is joint work with Jonathan Pila and Raf Cluckers