Past

We consider two-stage inflationary models in which a superheavy scale F-term hybrid inflation is followed by an intermediate scale modular inflation. We confront these models with the restrictions on the power spectrum of density perturbations P_R and the spectral index n_s from the recent data within the power-law cosmological model with cold dark matter and a cosmological constant. We show that these restrictions can be met provided that the number of e-foldings N_HI* of the pivot scale k*=0.002/Mpc during hybrid inflation is appropriately restricted. The additional e-foldings required for solving the horizon and flatness problems can be naturally generated by the subsequent modular inflation realized by a string axion.
   

Many recent algorithmic approaches involve the construction of a differential equation model for computational purposes, typically by introducing an artificial time variable. The actual computational model involves a discretization of the now time-dependent differential system, usually employing forward Euler. The resulting dynamics of such an algorithm is then a discrete dynamics, and it is expected to be ''close enough'' to the dynamics of the continuous system (which is typically easier to analyze) provided that small -- hence many -- time steps, or iterations, are taken. Indeed, recent papers in inverse problems and image processing routinely report results requiring thousands of iterations to converge. This makes one wonder if and how the computational modeling process can be improved to better reflect the actual properties sought.

In this talk we elaborate on several problem instances that illustrate the above observations. Algorithms may often lend themselves to a dual interpretation, in terms of a simply discretized differential equation with artificial time and in terms of a simple optimization algorithm; such a dual interpretation can be advantageous. We show how a broader computational modeling approach may possibly lead to algorithms with improved efficiency.

We will speak about the problem of classification of self-similar groups. The

main focus will be on groups generated by three-state  automata over an

alphabet on two letters. Numerous examples will be presented, as well as some

results concerning this class of groups.

I will describe some applications of the main techniques of rough paths

theory to problems not related to SDE

There will be three discussion meetings based on aspects of the

programme open to all internal project members. Others interested in

attending should contact Carlos Mora-Corral.

Countable Borel equivalence relations arise naturally as orbit equivalence

relations for countable groups. For each countable Borel equivalence relation E

there is an infinitary sentence such that E is equivalent to the isomorphism

relation on countable models of that sentence. For first order theories the

question is open.

The development and quantitative validation of complex nonlinear differential equation models is a difficult task that requires the support by numerical methods for sensitivity analysis, parameter estimation, and the optimal design of experiments. The talk first presents particularly efficient "simultaneous" boundary value problems methods for parameter estimation in nonlinear differential algebraic equations, which are based on constrained Gauss-Newton-type methods and a time domain decomposition by multiple shooting. They include a numerical analysis of the well-posedness of the problem and an assessment of the error of the resulting parameter estimates. Based on these approaches, efficient optimal control methods for the determination of one, or several complementary, optimal experiments are developed, which maximize the information gain subject to constraints such as experimental costs and feasibility, the range of model validity, or further technical constraints.

Special emphasis is placed on issues of robustness, i.e. how to reduce the sensitivity of the problem solutions with respect to uncertainties - such as outliers in the measurements for parameter estimation, and in particular the dependence of optimum experimental designs on the largely unknown values of the model parameters. New numerical methods will be presented, and applications will be discussed that arise in satellite orbit determination, chemical reaction kinetics, enzyme kinetics and robotics. They indicate a wide scope of applicability of the methods, and an enormous potential for reducing the experimental effort and improving the statistical quality of the models.

(Based on joint work with H. G. Bock, S. Koerkel, and J. P. Schloeder.)

Team meetings, held roughly every four weeks, are open to anyone who is

interested. OxMOS post docs and Dphil students will give updates on the

research.

I will talk about some ongoing work, motivated by a long standing problem in

the theory of dynamical systems. In particular, I will explain how p-adic

methods lead to the construction of elements in SL_n(Z) whose eigenvalues e_1,

., e_n generate a free abelian subgroup of rank n-1 in the multiplicative group

of positive real numbers. This is a special instance of a more general theorem,

asserting the existence of strongly hyperbolic elements in arithmetic subgroups

of SL_n(R).