L6

Monotonicity formulas play a pervasive role in the study of variational inequalities and free boundary problems. In this talk we will describe a new approach to a classical problem, namely the thin obstacle (or Signorini) problem, based on monotonicity properties for a family of so-called frequency functions.

We give a new proof of the Frankl-Rödl theorem on set systems with a forbidden intersection. Our method extends to codes with forbidden distances, where over large alphabets our bound is significantly better than that obtained by Frankl and Rödl. One consequence of our result is a Frankl-Rödl type theorem for permutations with a forbidden distance. Joint work with Peter Keevash.

Biharmonic maps are the solutions of a variational problem for maps

between Riemannian manifolds. But since the underlying functional

contains nonlinear differential operators that behave badly on the usual

Sobolev spaces, it is difficult to study it with variational methods. If

the target manifold has enough symmetry, however, then we can combine

analytic tools with geometric observations and make some statements

about existence and regularity.

We investigate the dynamics of a class of tumor growth

models known as mixed models. The key characteristic of these type of

tumor growth models is that the different populations of cells are

continuously present everywhere in the tumor at all times. In this

work we focus on the evolution of tumor growth in the presence of

proliferating, quiescent and dead cells as well as a nutrient.

The system is given by a multi-phase flow model and the tumor is

described as a growing continuum such that both the domain occupied by the tumor as well as its boundary evolve in time. Global-in-time weak solutions

are obtained using an approach based on penalization of the boundary

behavior, diffusion and viscosity in the weak formulation.

Further extensions will be discussed.

This is joint work with D. Donatelli.

We study liquid crystal point defects in 2D domains. We employ Landau-de

Gennes theory and provide a simplified description of global minimizers

of Landau- de Gennes energy under homeothropic boundary conditions. We

also provide explicit solutions describing defects of various strength

under Lyuksutov's constraint.

Steiner symmetrization is a very useful tool in the study of isoperimetric inequality. This is also due to the fact that the perimeter of a set is less or equal than the perimeter of its Steiner symmetral. In the same way, in the Gaussian setting,

it is well known that Ehrhard symmetrization does not increase the Gaussian perimeter. We will show characterization results for equality cases in both Steiner and Ehrhard perimeter inequalities. We will also characterize rigidity of equality cases. By rigidity, we mean the situation when all equality cases are trivially obtained by a translation of the Steiner symmetral (or, in the Gaussian setting, by a reflection of the Ehrhard symmetral). We will achieve this through the introduction of a suitable measure-theoretic notion of connectedness, and through a fine analysis of the barycenter function

for a special class of sets. These results are obtained in collaboration with Maria Colombo, Guido De Philippis, and Francesco Maggi.

In this talk we will show the existence  of a regular "small" weak solution to the flow of the higher dimensional H-systems with initial-boundary conditions. We also analyze its time asymptotic bahavior and we give a stability result.

This talk will focus on extremizers for

a family of Fourier restriction inequalities on planar curves. It turns

out that, depending on whether or not a certain geometric condition

related to the curvature is satisfied, extremizing sequences of

nonnegative functions may or may not have a subsequence which converges

to an extremizer. We hope to describe the method of proof, which is of

concentration compactness flavor, in some detail. Tools include bilinear

estimates, a variational calculation, a modification of the usual

method of stationary phase and several explicit computations.

We discuss some questions related to coloring the edge/vertices of randomgraphs. In particular we look at
(i) The game chromatic number;
(ii) Rainbow Matchings and Hamilton cycles;
(iii) Rainbow Connection;
(iv) Zebraic Colorings.