No abstract uploaded!

In this paper, we present an efficient \GQR\ algorithm for solving the linear response eigenvalue problem $\scrH\bx ={\lambda}\bx $, where $\scrH$ is $\bPi^-$-symmetric with respect to $\Gamma_0 = \diag(I_n,-I_n)$. Based on newly introduced $\Gamma$-orthogonal transformations, the \GQR\ algorithm preserves the $\bPi^-$-symmetric structure of $\scrH$ throughout the whole process, which guarantees the computed eigenvalues to appear pairwise $(\lambda,-\lambda)$ as they should. With the help of a newly established implicit $\Gamma$-orthogonality theorem, we incorporate the implicit multi-shift technique to accelerate the convergence of the \GQR\ algorithm. Numerical experiments are given to show the effectiveness of the algorithm.

We introduce fusion bialgebras and their duals and systematically study their Fourier analysis. As an application, we discover new efficient analytic obstructions on the unitary categorification of fusion rings. We prove the Hausdorff-Young inequality, uncertainty principles for fusion bialgebras and their duals. We show that the Schur product property, Young's inequality and the sum-set estimate hold for fusion bialgebras, but not always on their duals. If the fusion ring is the Grothendieck ring of a unitary fusion category, then these inequalities hold on the duals. Therefore, these inequalities are analytic obstructions of categorification. We classify simple integral fusion rings of Frobenius type up to rank 8 and of Frobenius-Perron dimension less than 4080. We find 34 ones, 4 of which are group-like and 28 of which can be eliminated by applying the Schur product property on the dual. In general, these inequalities are obstructions to subfactorize fusion bialgebras.

We construct a new subfactor planar algebra, and as a corollary a new subfactor, with the ‘extended Haagerup’ principal graph pair. This completes the classification of irreducible amenable subfactors with index in the range ( $$ {4},{3} + \sqrt {{3}} $$ ), which was initiated by Haagerup in 1993. We prove that the subfactor planar algebra with these principal graphs is unique. We give a skein-theoretic description, and a description as a subalgebra generated by a certain element in the graph planar algebra of its principal graph. In the skein-theoretic description there is an explicit algorithm for evaluating closed diagrams. This evaluation algorithm is unusual because intermediate steps may increase the number of generators in a diagram. This is the published version ofarXiv:0909.4099 [math.OA].

In this paper we study representation theory of the category FI^m introduced by Gadish which is a product of copies of the category FI, and show that quite a few interesting representational and homological properties of FI can be generalized to FI^m in a natural way. In particular, we prove the representation stability property of finitely generated FI^m -modules over fields of characteristic 0.