L3

It is a wide open question whether the set of rational points on a smooth quartic surface in projective three-space can be nonempty, yet finite. In this talk I will treat the case of diagonal quartics V, which are given by: a x^4 + b y^4 + c z^4 + d w^4 = 0 for some nonzero rational a,b,c,d. I will assume that the product abcd is a square and that V contains at least one rational point P. I will prove that if none of the coordinates of P is zero, and P is not contained in one of the 48 lines on V, then the set of rational points on V is dense. This is based on joint work with Adam Logan and David McKinnon.

We consider finite sequences $h = (h_1, . . . h_s)$ of real polynomials in $X_1, . . . ,X_n$ and assume that

the semi-algebraic subset $S(h)$ of $R^n$ defined by $h1(a1, . . . , an) \leq 0$, . . . , $hs(a1, . . . , an) \leq 0$ is

bounded. We call $h$ (quadratically) archimedean if every real polynomial $f$, strictly positive on

$S(h)$, admits a representation

$f = \sigma_0 + h_1\sigma_1 + \cdots + h_s\sigma_s$

with each $\sigma_i$ being a sum of squares of real polynomials.

If every $h_i$ is linear, the sequence h is archimedean. In general, h need not be archimedean.

There exists an abstract valuation theoretic criterion for h to be archimedean. We are, however,

interested in an effective procedure to decide whether h is archimedean or not.

In dimension n = 2, E. Cabral has given an effective geometric procedure for this decision

problem. Recently, S. Wagner has proved decidability for all dimensions using among others

model theoretic tools like the Ax-Kochen-Ershov Theorem.

Fixed-point logics are a class of logics designed for formalising

recursive or inductive definitions. Being initially studied in

generalised recursion theory by Moschovakis and others, they have later

found numerous applications in computer science, in areas

such as database theory, finite model theory, and verification.

A common feature of most fixed-point logics is that they extend a basic

logical formalism such as first-order or modal logic by explicit

constructs to form fixed points of definable operators. The type of

fixed points that can be formed as well as the underlying logic

determine the expressive power and complexity of the resulting logics.

In this talk we will give a brief introduction to the various extensions

of first-order logic by fixed-point constructs and give some examples

for properties definable in the different logics. In the main part of

the talk we will concentrate on extensions of first-order

logic by least and inflationary fixed points. In particular, we

compare the expressive power and complexity of the resulting logics.

The main result will be to show that while the two logics have rather

different properties, they are equivalent in expressive power on the

class of all structures.

In recent years Schanuel’s Conjecture (SC) has played a fundamental role

in the Theory of Transcendental Numbers and in decidability issues.

Macintyre and Wilkie proved the decidability of the real exponential field,

modulo (SC), solving in this way a problem left open by A. Tarski.

Moreover, Macintyre proved that the exponential subring of R generated

by 1 is free on no generators. In this line of research we obtained that in

the exponential ring $(\mathbb{C}, ex)$, there are no further relations except $i^2 = −1$

and $e^{i\pi} = −1$ modulo SC. Assuming Schanuel’s Conjecture we proved that

the E-subring of $\mathbb{R}$ generated by $\pi$ is isomorphic to the free E-ring on $\pi$.

These results have consequences in decidability issues both on $(\mathbb{C}, ex)$ and

$(\mathbb{R}, ex)$. Moreover, we generalize the previous results obtaining, without

assuming Schanuel’s conjecture, that the E-subring generated by a real

number not definable in the real exponential field is freely generated. We

also obtain a similar result for the complex exponential field.

I will give a few model theoretic properties for fields with a Hasse derivation which are existentially closed. I will explain how some type-definable sets allow us to understand properties of some algebraic varieties, mainly concerning their field of definition.

We demonstrate a scheme for controlling a large quantum system by acting

on a small subsystem only. The local control is mediated to the larger

system by some fixed coupling Hamiltonian. The scheme allows to transfer

arbitrary and unknown quantum states from a memory to the large system

("upload access") as well as the inverse ("download access").

We give sufficient conditions of the coupling Hamiltonian for the

controllability

of the system which can be checked efficiently by a colour-infection game on

the graph

that describes the couplings.

There are two basic theories of curve counting on Calabi-Yau threefolds. Donaldson-Thomas theory arises by considering curves as subschemes; Gromov-Witten theory arises by considering curves as the image of maps. Both theories can also be formulated for orbifolds. Let X be a dimension three Calabi-Yau orbifold and let

Y --> X be a Calabi-Yau resolution. The Gromov-Witten theories of X and Y are related by the Crepant Resolution Conjecture. The Gromov-Witten and Donaldson-Thomas theories of Y are related by the famous MNOP conjecture. In this talk I will (with some provisos) formulate the remaining equivalences: the crepant resolution conjecture in Donaldson-Thomas theory and the MNOP conjecture for orbifolds. I will discuss examples to illustrate and provide evidence for the conjectures.

Lusztig discover an integral lift of the Frobenius morphism for algebraic groups in positive characteristic to quantum groups at a root of unity. We will describe how this map may be constructed via the Hall algebra realization of a quantum group.

Modern molecular biology research produces data on a massive scale. This

data

is predominantly high-dimensional, consisting of genome-wide measurements of

the transcriptome, proteome and metabalome. Analysis of these data sets

often

face the additional problem of having small sample sizes, as experimental

data

points may be difficult and expensive to come by. Many analysis algorithms

are

based upon estimating the covariance structure from this high-dimensional

small sample size data, with the consequence that the eigenvalues and eigenvectors

of

the estimated covariance matrix are markedly different from the true values.

Techniques from statistical physics and Random Matrix Theory allow us to

understand how these discrepancies in the eigenstructure arise, and in

particular locate the phase transition points where the eigenvalues and

eigenvectors of the estimated covariance matrix begin to genuinely reflect

the

underlying biological signals present in the data. In this talk I will give

a

brief non-specialist introduction to the biological background motivating

the

work and highlight some recent results obtained within the statistical

physics

approach.