14:30
Forbidden vector-valued intersection
Abstract
Given vectors $V = (v_i: i \in [n]) \in R^D$, we define the $V$-intersection of $A,B \subset [n]$ to be the vector $\sum_{i \in A \cap B} v_i$. In this talk, I will discuss a new, essentially optimal, supersaturation theorem for $V$-intersections, which can be roughly stated as saying that any large family of sets contains many pairs $(A,B)$ with $V$-intersection $w$, for a wide range of $V$ and $w$. A famous theorem of Frankl and Rödl corresponds to the case $D=1$ and all $v_i=1$ of our theorem. The case $D=2$ and $v_i=(1,i)$ solves a conjecture of Kalai.
Joint work with Peter Keevash.
14:30
Turán Numbers via Local Stability Method
Abstract
The Turán number of an $r$-graph $G$, denoted by $ex(n,G)$, is the maximum number of edges in an $G$-free $r$-graph on $n$ vertices. The Turán density of an $r$-graph $G$, denoted by $\pi(G)$, is the limit as $n$ tends to infinity of the maximum edge density of an $G$-free $r$-graph on $n$ vertices.
During this talk I will discuss a method, which we call local stability method, that allows one to obtain exact Turán numbers from Turán density results. This method can be thought of as an extension of the classical stability method by generically utilising the Lagrangian function. Using it, we obtained new hypergraph Turán numbers. In particular, we did so for a hypergraph called generalized triangle, for uniformities 5 and 6, which solved a conjecture of Frankl and Füredi from 1980's.
This is joint work with Sergey Norin.
Kähler groups, residually free groups and subgroups of direct products of surface groups.
Abstract
A Kähler group is a group which can be realised as the fundamental group of a close Kähler manifold. We will prove that for a Kähler group $G$ we have that $G$ is residually free if and only if $G$ is a full subdirect product of a free abelian group and finitely many closed hyperbolic surface groups. We will then address Delzant-Gromov's question of which subgroups of direct products of surface groups are Kähler: We explain how to construct subgroups of direct products of surface groups which have even first Betti number but are not Kähler. All relevant notions will be explained in the talk.
Optimization with occasionally accurate data
Abstract
We present global rates of convergence for a general class of methods for nonconvex smooth optimization that include linesearch, trust-region and regularisation strategies, but that allow inaccurate problem information. Namely, we assume the local (first- or second-order) models of our function are only sufficiently accurate with a certain probability, and they can be arbitrarily poor otherwise. This framework subsumes certain stochastic gradient analyses and derivative-free techniques based on random sampling of function values. It can also be viewed as a robustness
assessment of deterministic methods and their resilience to inaccurate derivative computation such as due to processor failure in a distribute framework. We show that in terms of the order of the accuracy, the evaluation complexity of such methods is the same as their counterparts that use deterministic accurate models; the use of probabilistic models only increases the complexity by a constant, which depends on the probability of the models being good. Time permitting, we also discuss the case of inaccurate, probabilistic function value information, that arises in stochastic optimization. This work is joint with Katya Scheinberg (Lehigh University, USA).
The cotangent complex and the derived de Rham algebra
Abstract
This is a survey (with some proofs) of chapter 2 of the notes http://renyi.mta.hu/~szamuely/beilintronew.pdf of T. Szamuely and G. Zabradi on Beilinson's approach to the p-adic Hodge decomposition theorem.
10:00
Hall Algebras and Green's theorem
Abstract
Hall algebras are a deformation of the K-group (Grothendieck group) of an abelian category, which encode some information about non-trivial extensions in the category.
A main feature of Hall algebras is that in addition to the product (which deforms the product in the K-group) there is a natural coproduct, which in certain cases makes the Hall algebra a (braided) bi-algebra. This is the content of Green's theorem and supplies the main ingredient in a construction of quantum groups.
14:30
Finite Reflection Groups and Graph Norms
Abstract
For any given graph H, we may define a natural corresponding functional ||.||_H. We then say that H is norming if ||.||_H is a semi-norm. A similar notion ||.||_{r(H)} is defined by || f ||_{r(H)}:=|| | f | ||_H and H is said to be weakly norming if ||.||_{r(H)} is a norm. Classical results show that weakly norming graphs are necessarily bipartite. In the other direction, Hatami showed that even cycles, complete bipartite graphs, and hypercubes are all weakly norming. Using results from the theory of finite reflection groups, we demonstrate that any graph which is edge-transitive under the action of a certain natural family of automorphisms is weakly norming. This result includes all previous examples of weakly norming graphs and adds many more. We also include several applications of our results. In particular, we define and compare a number of generalisations of Gowers' octahedral norms and we prove some new instances of Sidorenko's conjecture. Joint work with David Conlon.
16:00
Gaps Between Smooth Numbers
Abstract
Let $a_1, \cdots, a_N$ be the sequence of y-smooth numbers up to x (i.e. composed only of primes up to y). When y is a small power of x, what can one say about the size of the gaps $a_{j+1}-a_j$? In particular, what about
$$\sum_1^N (a_{j+1}-a_j)^2?$$