We show that Hecke algebra of type B and a coideal subalgebra of the type A quantum group satisfy a double centralizer property, generalizing the Schur-Jimbo duality in type A. The quantum group of type A and its coideal subalgebra form a quantum symmetric pair. A new theory of canonical bases arising from quantum symmetric pairs is initiated. It is then applied to formulate and establish for the first time a Kazhdan-Lusztig theory for the BGG category O of the ortho-symplectic Lie superalgebras $\mathfrak{osp}(2m+1|2n)$. In particular, our approach provides a new formulation of the Kazhdan-Lusztig theory for Lie algebras of type B/C.

We prove the famous Faber intersection number conjecture and other more general results by using a recursion formula of n-point functions for intersection numbers on moduli spaces of curves. We also present some vanishing properties of Gromov-Witten invariants.

Intrinsic Delaunay triangulation (IDT) naturally generalizes Delaunay triangulation from R^2 to curved surfaces. Due to many favorable properties, the IDT whose vertex set includes all mesh vertices is of particular interest in polygonal mesh processing. To date, the only way for constructing such IDT is the edge-flipping algorithm, which iteratively flips non-Delaunay edges to become locally Delaunay. Although this algorithm is conceptually simple and guarantees to terminate in finite steps, it has no known time complexity and may also produce triangulations containing faces with only two edges. This article develops a new method to obtain proper IDTs on manifold triangle meshes.We first compute a geodesic Voronoi diagram (GVD) by taking all mesh vertices as generators and then find its dual graph. The sufficient condition for the dual graph to be a proper triangulation is that all Voronoi cells satisfy the so-called closed ball property. To guarantee the closed ball property everywhere, a certain sampling criterion is required. For Voronoi cells that violate the closed ball property, we fix them by computing topologically safe regions, inwhich auxiliary sites can be addedwithout changing the topology of theVoronoi diagram beyond them.Given a meshwith n vertices, we prove that by adding at most O(n) auxiliary sites, the computed GVD satisfies the closed ball property, and hence its dual graph is a proper IDT. Our method has a theoretical worst-case time complexity O(n^2 + tn log n), where t is the number of obtuse angles in the mesh. Computational results show that it empirically runs in linear time on real-world models.

No abstract uploaded!

No abstract uploaded!