L6

For this workshop, we have identified two subject of interest for us in the field of particle technology, one the wet granulation is a size enlargement process of converting small-diameter solid particles (typically powders) into larger-diameter agglomerates to generate a specific size, the other one the mechanical centrifugal air classifier is employed when the particle size that you need to separate is too fine to screen.

Hardy and Littlewood's approximate functional equation for quadratic Weyl sums (theta sums) provides, by iterative application, a powerful tool for the asymptotic analysis of such sums. The classical Jacobi theta function, on the other hand, satisfies an exact functional equation, and extends to an automorphic function on the Jacobi group. In the present study we construct a related, almost everywhere non-differentiable automorphic function, which approximates quadratic Weyl sums up to an error of order one, uniformly in the summation range. This not only implies the approximate functional equation, but allows us to replace Hardy and Littlewood's renormalization approach by the dynamics of a certain homogeneous flow. The great advantage of this construction is that the approximation is global, i.e., there is no need to keep track of the error terms accumulating in an iterative procedure. Our main application is a new functional limit theorem, or invariance principle, for theta sums. The interesting observation here is that the paths of the limiting process share a number of key features with Brownian motion (scale invariance, invariance under time inversion, non-differentiability), although time increments are not independent and the value distribution at each fixed time is distinctly different from a normal distribution. Joint work with Francesco Cellarosi.

Suppose we have a finite graph. We can view this as a resistor network where each edge has unit resistance. We can then calculate the resistance between any two vertices and ask questions like `which graph with $n$ vertices and $m$ edges minimises the average resistance between pairs of vertices?' There is a `obvious' solution; we show that this answer is not correct.

This problem was motivated by some questions about the design of statistical experiments (and has some surprising applications in chemistry) but this talk will not assume any statistical knowledge.

This is joint work with Robert Johnson.

In this talk we present a new type of Soblev norm defined in the space of functions of continuous paths. Under the Wiener probability measure the corresponding norm is suitable to prove the existence and uniqueness for a large type of system of path dependent quasi-linear parabolic partial differential equations (PPDE). We have establish 1-1 correspondence between this new type of PPDE and the classical backward SDE (BSDE). For fully nonlinear PPDEs, the corresponding Sobolev norm is under a sublinear expectation called G-expectation, in the place of Wiener expectation. The canonical process becomes a new type of nonlinear Brownian motion called G-Brownian motion. A similar 1-1 correspondence has been established. We can then apply the recent results of existence, uniqueness and principle of comparison for BSDE driven by G-Brownian motion to obtain the same result for the PPDE.

A compact space is a Rosenthal compactum if it can be embedded into the space of Baire class 1 functions on a Polish space. Those objects have been well studied in functional analysis and set theory. In this talk, I will explain the link between them and the model-theoretic notion of NIP and how they can be used to prove new results in model theory on the topology of the space of types.
 

Dellamonica, Kohayakawa, Rödl and Ruciński showed that for $p=C(\log n/n)^{1/d}$ the random graph $G(n,p)$ contains asymptotically almost surely all spanning graphs $H$ with maximum degree $d$ as subgraphs. In this talk I will discuss a resilience version of this result, which shows that for the same edge density, even if a $(1/k-\epsilon)$-fraction of the edges at every vertex is deleted adversarially from $G(n,p)$, the resulting graph continues to contain asymptotically almost surely all spanning $H$ with maximum degree $d$, with sublinear bandwidth and with at least $C \max\{p^{-2},p^{-1}\log n\}$ vertices not in triangles. Neither the restriction on the bandwidth, nor the condition that not all vertices are allowed to be in triangles can be removed. The proof uses a sparse version of the Blow-Up Lemma. Joint work with Peter Allen, Julia Ehrenmüller, Anusch Taraz.

Erdős asked the following question: given a positive integer $n$, what is the largest integer $k$ such that any set of $n$ points in a plane, with no $4$ on a line, contains $k$ points no $3$ of which are collinear? Füredi proved that $k = o(n)$. Cardinal, Toth and Wood extended this result to $\mathbb{R}^3$, finding sets of $n$ points with no $5$ on a plane whose subsets with no $4$ points on a plane have size $o(n)$, and asked the question for the higher dimensions. For given $n$, let $k$ be largest integer such that any set of $n$ points in $\mathbb{R}^d$ with no more than $d + 1$ cohyperplanar points, has $k$ points with no $d + 1$ on a hyperplane. Is $k = o(n)$? We prove that $k = o(n)$ for any fixed $d \geq 3$.

The Number Field Sieve is the current practical and theoretical state of the art algorithm for factoring. Unfortunately, there has been no rigorous analysis of this type of algorithm. We randomise key aspects of the number theory, and prove that in this variant congruences of squares are formed in expected time $L(1/3, 2.88)$. These results are tightly coupled to recent progress on the distribution of smooth numbers, and we provide additional tools to turn progress on these problems into improved bounds.