Using the geometric Satake correspondence, the Mirković–Vilonen cycles in the affine Grasssmannian give bases for representations of a semisimple group G. We prove that these bases are “perfect”, i.e. compatible with the action of the Chevelley generators of the positive half of the Lie algebra g. We compute this action in terms of intersection multiplicities in the affine Grassmannian. We prove that these bases stitch together to a basis for the algebra C[N] of regular functions on the unipotent subgroup. We compute the multiplication in this MV basis using intersection multiplicities in the Beilinson–Drinfeld Grassmannian, thus proving a conjecture of Anderson. In the third part of the paper, we define a map from C[N] to a convolution algebra of measures on the dual of the Cartan subalgebra of g. We characterize this map using the universal centralizer space of G. We prove that the measure associated with an MV basis element equals the Duistermaat–Heckman measure of the corresponding MV cycle. This leads to a proof of a conjecture of Muthiah. Finally, we use the map to measures to compare the MV basis and Lusztig’s dual semicanonical basis. We formulate conjectures relating the algebraic invariants of preprojective algebra modules (which underlie the dual semicanonical basis) and geometric invariants of MV cycles. In the appendix, we use these ideas to prove that the MV basis and the dual semicanonical basis do not coincide in SL_6 .

No abstract uploaded!

Automatic hexahedral mesh generation plays a fundamental role in CAD/CAE fields, especially for IGA (isogeometric analysis). Recently, an automatic hex-mesh generation method has been proposed, which is based on the equivalence among three key concepts: colorable quadrilateral meshes, finite measured foliations and Strebel differentials. This work focuses on the computational aspect of Strebel differentials on high genus surfaces, which is based on graph-valued harmonic mapping. The algorithmic pipeline is as follows: first, the user inputs an admissible curve system, which induces a cylindric-decomposition graph; then the user specifies the lengths of the edges of the graph; third, the algorithm finds the unique harmonic map from the surface to the metric graph by a non-linear heat flow; finally, the harmonic map induces a Strebel differential, which can be further utilized to generate the hex-mesh. The method has solid theoretic foundation, which guarantees the existence and the uniqueness of the graph-valued harmonic map. The algorithm is capable of handling surfaces with complicated topologies, and producing all possible Strebel differentials on the surface. The user has full control of the combinatorial type and the geometry of the Strebel differential. The computational pipeline is automatic. The experimental results show the efficiency and efficacy of the algorithm, and demonstrate the great potential for automating the structured hexahedral mesh generation.

No abstract uploaded!

No abstract uploaded!