No abstract uploaded!

We solve the entanglement classification under stochastic local operations and classical communication (SLOCC) for general n-qubit states. For two arbitrary pure n-qubit states connected via local operations, we establish an equation between the two coefficient matrices associated with the states. The rank of the coefficient matrix is preserved under SLOCC and gives rise to a simple way of partitioning all the pure states of n qubits into different families of entanglement classes, as exemplified here. When applied to the symmetric states, this approach reveals that all the Dicke states |l,n> with l=1,..., [n/2] are inequivalent under SLOCC.

Li-Nadler proposed a conjecture about traces of Hecke categories, which implies the semistable part of the Betti geometric Langlands conjecture of Ben-Zvi-Nadler in genus 1. We prove a Weyl group analogue of this conjecture. Our theorem holds in the natural generality of reflection groups in Euclidean or hyperbolic space. As a corollary, we give an expression of the centralizer of a finite order element in a reflection group using homotopy theory.

Finding surface mappings with least distortion arises from many applications in various fields. Extremal Teichmüller maps are surface mappings with least conformality distortion. The existence and uniqueness of the extremal Teichmüller map between Riemann surfaces of finite type are theoretically guaranteed (see Fletcher and Markovic, Quasiconformal maps and Teichmüller theory, Oxford Graduate Texts in Math., vol. 11, Oxford University Press, Oxford, 2007). Recently, a simple iterative algorithm for computing the Teichmüller maps between connected Riemann surfaces with given boundary value was proposed by Lui, Lam, Yau, and Gu in Teichmüller extremal mapping and its applications to landmark matching registration, arXiv:1211.2569. Numerical results were reported in the paper to show the effectiveness of the algorithm. The method was successfully applied to landmarkmatching registration. The purpose of this paper is to prove the iterative algorithm proposed in loc. cit., indeed converges.

No abstract uploaded!