For the three-dimensional full compressible Navier–Stokes system describing the motion of a viscous, compressible, heat-conductive, and Newtonian polytropic fluid, we establish the global existence and uniqueness of classical solutions with smooth initial data which are of small energy but possibly large oscillations where the initial density is allowed to vanish. Moreover, for the initial data, which may be discontinuous and contain vacuum states, we also obtain the global existence of weak solutions. These results generalize previous ones on classical and weak solutions for initial density being strictly away from a vacuum, and are the first for global classical and weak solutions which may have large oscillations and can contain vacuum states.

No abstract uploaded!

Varagnolo and Vasserot conjectured an equivalence between the category O for CRDAHA’s and a subcategory of an affine parabolic category O of type A. We prove this conjecture. As applications, we prove a conjecture of Rouquier on the dimension of simple modules of CRDAHA’s and a conjecture of Chuang–Miyachi on the Koszul duality for the category O of CRDAHA’s.

No abstract uploaded!

In this work, we give a geometric interpretation to the Generative Adversarial Networks (GANs). The geometric view is based on the intrinsic relation between Optimal Mass Transportation (OMT) theory and convex geometry, and leads to a variational approach to solve the Alexandrov problem: constructing a convex polytope with prescribed face normals and volumes. By using the optimal transportation view of GAN model, we show that the discriminator computes the Wasserstein distance via the Kantorovich potential, the generator calculates the transportation map. For a large class of transportation costs, the Kantorovich potential can give the optimal transportation map by a close-form formula. Therefore, it is sufficient to solely optimize the discriminator. This shows the adversarial competition can be avoided, and the computational architecture can be simplified. Preliminary experimental results show the geometric method outperforms the traditional Wasserstein GAN for approximating probability measures with multiple clusters in low dimensional space.