For an essentially normal operator$T$, it is shown that there exists a unilateral shift of multiplicity$m$in$C$^{$*$}$(T)$if and only if γ($T$)≠0 and γ$(T)/m$. As application, we prove that the essential commutant of a unilateral shift and that of a bilateral shift are not isomorphic as$C$^{$*$}-algebras. Finally, we construct a natural$C$^{$*$}-algebra ε + ε_{*}on the Bergman space$L$_{$a$}^{$2$}($B$_{$n$}), and show that its essential commutant is generated by Toeplitz operators with symmetric continuous symbols and all compact operators.

Let$Z$be the zero set of a holomorphic section$f$of a Hermitian vector bundle. It is proved that the current of integration over the irreducible components of$Z$of top degree, counted with multiplicities, is a product of a residue factor$R$^{$f$}and a “Jacobian factor”. There is also a relation to the Monge-Ampère expressions ($dd$^{$c$}log|$f$|)^{$k$}, which we define for all positive powers$k$.

Near-superradiant scattering of charged scalars and fermions by a near-extreme Kerr-Newman black hole and photons and gravitons by a near-extreme Kerr black hole are computed as certain Fourier transforms of correlators in a two-dimensional conformal field theory. The results agree with the classic spacetime calculations from the 1970s, thereby providing good evidence for a conjectured Kerr-Newman/CFT correspondence.

No abstract uploaded!

The medial axis is an important shape representation that finds a wide range of applications in shape analysis. For large-scale shapes of high resolution, a progressive medial axis representation that starts with the lowest resolution and gradually adds more details is desired. In this paper, we propose a fast and robust geometric algorithm that computes progressive medial axes of a large-scale planar shape. The key ingredient of our method is a novel structural analysis of merging medial axes of two planar shapes along a shared boundary. Our method is robust by separating the analysis of topological structure from numerical computation. Our method is also fast and we show that the time complexity of merging two medial axes is O(n log nv), where n is the number of total boundary generators, nv is strictly smaller than n and behaves as a small constant in all our experiments. Experiments on large-scale polygonal data and comparison with state-of-the-art methods show the efficiency and effectiveness of the proposed method.