Thu, 14 Jun 2012

17:00 - 18:00
L3

Algebraic closure in pseudofinite fields

Özlem Beyarslan (Bogazici)
Abstract

A pseudofinite field is a perfect pseudo-algebraically closed (PAC) field which

has $\hat{\mathbb{Z}}$ as absolute Galois group. Pseudofinite fields exists and they can

be realised as ultraproducts of finite fields. A group $G$ is geometrically

represented in a theory $T$ if there are modles $M_0\prec M$ of $T$,

substructures $A,B$ of $M$, $B\subset acl(A)$, such that $M_0\le A\le B\le M$

and $Aut(B/A)$ is isomorphic to $G$. Let $T$ be a complete theory of

pseudofinite fields. We show that, geometric representation of a group whose order

is divisibly by $p$ in $T$ heavily depends on the presence of $p^n$'th roots of unity

in models of $T$. As a consequence of this, we show that, for almost all

completions of the theory of pseudofinite fields, over a substructure $A$, algebraic

closure agrees with definable closure, if $A$ contains the relative algebraic closure

of the prime field. This is joint work with Ehud Hrushovski.

Thu, 24 May 2012

17:00 - 18:00
L3

S-independence in NIP theories

Pierre Simon (Ecole Normale Superiore)
Abstract

I will explain how to define a notion of stable-independence in NIP

theories, which is an attempt to capture the "stable part" of types.

Thu, 17 May 2012

17:00 - 18:00
L3

TBA

*Cancelled*
Thu, 26 Apr 2012

17:00 - 18:00
L3

Connecting Schanuel's Conjecture to Shapiro's Conjecture

Angus Macintyre (QMUL)
Abstract

Shapiro's Conjecture says that two classical exponential polynomials over the complexes can have infinitely many common zeros only for algebraic reasons. I will explain the history of this, the connection to Schanuel's Conjecture, and sketch a proof for the complexes using Schanuel, as well as an unconditional proof for Zilber's fields.

Mon, 30 Apr 2012

15:45 - 16:45
L3

Configuration spaces and homological stability

Martin Palmer
(Oxford)
Abstract

For a fixed background manifold $M$ and parameter-space $X$, the associated configuration space is the space of $n$-point subsets of $M$ with parameters drawn from $X$ attached to each point of the subset, topologised in a natural way so that points cannot collide. One can either remember or forget the ordering of the n points in the configuration, so there are ordered and unordered versions of each configuration space.

It is a classical result that the sequence of unordered configuration spaces, as $n$ increases, is homologically stable: for each $k$ the degree-$k$ homology is eventually independent of $n$. However, a simple counterexample shows that this result fails for ordered configuration spaces. So one could ask whether it's possible to remember part of the ordering information and still have homological stability.

The goal of this talk is to explain the ideas behind a positive answer to this question, using 'oriented configuration spaces', in which configurations are equipped with an ordering - up to even permutations - of their points. I will also explain how this case differs from the unordered case: for example the 'rate' at which the homology stabilises is strictly slower for oriented configurations.

If time permits, I will also say something about homological stability with twisted coefficients.

Mon, 11 Jun 2012

15:45 - 16:45
L3

Mixed 3-manifolds are virtually special

Piotr Przytycki
(Warsaw)
Abstract

This is joint work with Dani Wise and builds on his earlier

work. Let M be a compact oriented irreducible 3-manifold which is neither a

graph manifold nor a hyperbolic manifold. We prove that the fundamental

group of M is virtually special. This means that it virtually embeds in a

right angled Artin group, and is in particular linear over Z.

Mon, 23 Apr 2012

15:45 - 16:45
L3

On the decidability of the zero divisor problem

Lukasz Grabowksi
(Imperial)
Abstract

Let G be a finitely generated group generated by g_1,..., g_n. Consider the alphabet A(G) consisting of the symbols g_1,..., g_n and the symbols '+' and '-'. The words in this alphabet represent elements of the integral group ring Z[G]. In the talk we will investigate the computational problem of deciding whether a word in the alphabet A(G) determines a zero-divisor in Z[G]. We will see that a version of the Atiyah conjecture (together with some natural assumptions) imply decidability of the zero-divisor problem; however, we'll also see that in the group (Z/2 \wr Z)^4 the zero-divisor problem is not decidable. The technique which allows one to see the last statement involves "embedding" a Turing machine into a group ring.

Subscribe to L3