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.