No abstract uploaded!

In this paper, we derive estimates for scalar curvature type equations with more singular right hand side. As an application, we prove Donaldson's conjecture on the equivalence between geodesic stability and existence of cscK when $Aut_0(M,J)\neq0$. Moreover, we show that when $Aut_0(M,J)\neq0$, the properness of $K$-energy with respect to a suitably defined distance implies the existence of cscK.

No abstract uploaded!

The embedded cobordism category under study in this paper generalizes the category of conformal surfaces, introduced by G. Segal in [S2] in order to formalize the concept of field theories. Our main result identifies the homotopy type of the classifying space of the embedded$d$-dimensional cobordism category for all$d$. For$d$= 2, our results lead to a new proof of the generalized Mumford conjecture, somewhat different in spirit from the original one, presented in [MW].

We present novel algorithms for compressible flows that\n\nare efficient for all Mach numbers. The approach is based on several\n\ningredients: semi-implicit schemes, the gauge decomposition\n\nof the velocity field and a second order formulation of the density\n\nequation (in the isentropic case) and of the energy equation (in\n\nthe full Navier-Stokes case). Additionally, we show that our approach\n\ncorresponds to a micro-macro decomposition of the model,\n\nwhere the macro field corresponds to the incompressible component\n\nsatisfying a perturbed low Mach number limit equation and\n\nthe micro field is the potential component of the velocity. Finally,\n\nwe also use the conservative variables in order to obtain a proper\n\nconservative formulation of the equations when the Mach number\n\nis order unity. We successively consider the isentropic case, the\n\nfull Navier-Stokes case, and the isentropic Navier-Stokes-Poisson\n\ncase. In this work, we only concentrate on the question of the\n\ntime discretization and show that the proposed method leads to\n\nAsymptotic Preserving schemes for compressible flows in the low\n\nMach number limit.