The classical uncertainty principles deal with functions on abelian groups. In this paper, we discuss the uncertainty principles for finite index subfactors which include the cases for finite groups and finite dimensional Kac algebras. We prove the HausdorffYoung inequality, Young's inequality, the HirschmanBeckner uncertainty principle, the DonohoStark uncertainty principle. We characterize the minimizers of the uncertainty principles and then we prove Hardy's uncertainty principle by using minimizers. We also prove that the minimizer is uniquely determined by the supports of itself and its Fourier transform. The proofs take the advantage of the analytic and the categorial perspectives of subfactor planar algebras. Our method to prove the uncertainty principles also works for more general cases, such as Popa's <i></i>-lattices, modular tensor categories, etc.

If$X$is a closed subset of the real line, denote by$G$_{$X$}the supremum of the size of the gap in the Fourier spectrum of a measure, taken over all non-trivial finite complex measures supported on$X$. In this paper we attempt to find$G$_{$X$}in terms of$X$.

We aim to maximize the number of first-quadrant lattice points in a convex domain with respect to reciprocal stretching in the coordinate directions. The optimal domain is shown to be asymptotically balanced, meaning that the stretch factor approaches 1 as the “radius” approaches infinity. In particular, the result implies that among all p-ellipses (or Lamé curves), the p-circle encloses the most first-quadrant lattice points as the radius approaches infinity, for 1<p<∞. The case p=2 corresponds to minimization of high eigenvalues of the Dirichlet Laplacian on rectangles, and so our work generalizes a result of Antunes and Freitas. Similarly, we generalize a Neumann eigenvalue maximization result of van den Berg, Bucur and Gittins. Further, Ariturk and Laugesen recently handled 0<p<1 by building on our results here. The case p=1 remains open, and is closely related to minimizing energy levels of harmonic oscillators: which right triangles in the first quadrant with two sides along the axes will enclose the most lattice points, as the area tends to infinity?

We study the multiplicative Hilbert matrix, i.e. the infinite matrix with entries (mn−−−√log(mn))−1 for m,n≥2. This matrix was recently introduced within the context of the theory of Dirichlet series, and it was shown that the multiplicative Hilbert matrix has no eigenvalues and that its continuous spectrum coincides with [0,π]. Here we prove that the multiplicative Hilbert matrix has no singular continuous spectrum and that its absolutely continuous spectrum has multiplicity one. Our argument relies on spectral perturbation theory and scattering theory. Finding an explicit diagonalisation of the multiplicative Hilbert matrix remains an interesting open problem.

We consider problems related to the asymptotic minimization of eigenvalues of anisotropic harmonic oscillators in the plane. In particular we study Riesz means of the eigenvalues and the trace of the corresponding heat kernels. The eigenvalue minimization problem can be reformulated as a lattice point problem where one wishes to maximize the number of points of (N−12)×(N−12) inside triangles with vertices (0,0),(0,λβ−−√) and (λ/β−−√,0) with respect to β>0, for fixed λ≥0. This lattice point formulation of the problem naturally leads to a family of generalized problems where one instead considers the shifted lattice (N+σ)×(N+τ), for σ,τ>−1. We show that the nature of these problems are rather different depending on the shift parameters, and in particular that the problem corresponding to harmonic oscillators, σ=τ=−12, is a critical case.