Related papers: Discrete Quantization on Spherical Geometries: Exp…
In Moyal's formulation of quantum mechanics, a quantum spin s is described in terms of continuous symbols, i.e. by smooth functions on a two-dimensional sphere. Such prescriptions to associate operators with Wigner functions, P- or…
Point discretization of curved surfaces is required in many applications ranging from object rendering to the solution of surface partial differential equations (PDEs). These applications often impose that surfaces are sampled with local…
Based on Welzl's algorithm for smallest circles and spheres we develop a simple linear time algorithm for finding the smallest circle enclosing a point cloud on a sphere. The algorithm yields correct results as long as the point cloud is…
Image data are often composed of two or more geometrically distinct constituents; in galaxy catalogs, for instance, one sees a mixture of pointlike structures (galaxy superclusters) and curvelike structures (filaments). It would be ideal to…
Rayleigh quotient minimization deals with optimizing a quadratic homogeneous function over a sphere. Its critical points correspond to the normalized eigenvectors of the symmetric matrix associated with the quadratic form. In this paper, we…
Exploiting analogies between the precessing quantum spin system and the charge-monopole system, we construct Bloch hyper-spheres with $\it{exact}$ spherical symmetries in arbitrary dimensions. Such Bloch hyper-spheres are realized as a…
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…
An exact quantization of the spherical membrane moving in flat target spacetime backgrounds is performed. Crucial ingredients are the exact integrabilty of the $3D~SU(\infty)$ continuous Toda equation and the quasi-finite highest weight…
In this paper, we develop a quadrature framework for large-scale kernel machines via a numerical integration representation. Considering that the integration domain and measure of typical kernels, e.g., Gaussian kernels, arc-cosine kernels,…
We introduce a novel type of approximation spaces for functions with values in a nonlinear manifold. The discrete functions are constructed by piecewise polynomial interpolation in a Euclidean embedding space, and then projecting pointwise…
We analyze the anti-symmetric properties of a spectral discretization for the one-dimensional Vlasov-Poisson equations. The discretization is based on a spectral expansion in velocity with the symmetrically weighted Hermite basis functions,…
In this article we investigate the $N$-point min-max and the max-min polarization problems on the sphere for a large class of potentials in $\mathbb{R}^n$. We derive universal lower and upper bounds on the polarization of spherical designs…
In this Letter we study discrete symmetries of mean field manifolds of condensates of F=2 cold atoms, and various unconventional quantum vortices. Discrete quaternion symmetries result in two species of spin defects that can only appear in…
In this article we give a universal model for geometric quantization associated to a real polarization given by an integrable system with non-degenerate singularities. This universal model goes one step further than the previous cotangent…
Spherical $t$-designs are finite point sets on the unit sphere that enable exact integration of polynomials of degree at most $t$ via equal-weight quadrature. This concept has recently been extended to spherical $t$-design curves by the use…
Accurately and efficiently predicting the equilibrium geometries of large molecules remains a central challenge in quantum computational chemistry, even with hybrid quantum-classical algorithms. Two major obstacles hinder progress: the…
We propose an extrapolation technique that allows accuracy improvement of the discrete dipole approximation computations. The performance of this technique was studied empirically based on extensive simulations for 5 test cases using many…
In R^3, let M be the infinite union of unit spheres whose centers lie at even integers on the x-axis; every pair of consecutive spheres touches at (2m+1, 0, 0). Desingularizing these point contacts yields Delaunay's classical constant mean…
In this paper we study the geometry of metric spheres in the curve complex of a surface, with the goal of determining the "average" distance between points on a given sphere. Averaging is not technically possible because metric spheres in…
We present a computational methodology for obtaining rotationally symmetric sets of points satisfying discrete geometric constraints, and demonstrate its applicability by discovering new solutions to some well-known problems in…