Related papers: Noncommutative Spherical Codes
In this article, we introduce and study the concept of $\textit{spherical-vectors}$, which can be perceived as a natural extension of the arguments of complex numbers in the context of quaternions. We initially establish foundational…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
Let S be an operator system -- a self-adjoint linear subspace of a unital C*-algebra A such that contains 1 and A=C*(S) is generated by S. A boundary representation for S is an irreducible representation \pi of C*(S) on a Hilbert space with…
Heteroclinic-induced spiral waves may arise in systems of partial differential equations that exhibit robust heteroclinic cycles between spatially uniform equilibria. Robust heteroclinic cycles arise naturally in systems with invariant…
Looking to the history of mathematics one could find out two outer approaches to Geometry. First one (algebraic) is due to Descartes and second one (group-theoretic)--to Klein. We will see that they are not rivalling but are tied (by…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
Results from helically symmetric scalar field models and first results from a convergent helically symmetric binary neutron star code are reported here; these are models stationary in the rotating frame of a source with constant angular…
The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…
We present a simulation code which can solve broad ranges of partial differential equations in a full sphere. The code expands tensorial variables in a spectral series of spin-weighted spherical harmonics in the angular directions and a…
The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…
A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…
A novel perturbative method, proposed by Panda {\it et al.} [1] to solve the Helmholtz equation in two dimensions, is extended to three dimensions for general boundary surfaces. Although a few numerical works are available in the literature…
Cone spherical metrics are conformal metrics with constant curvature one and finitely many conical singularities on compact Riemann surfaces. A cone spherical metric is called irreducible if each developing map of the metric does not have…
We introduce a framework for constructing quantum codes defined on spheres by recasting such codes as quantum analogues of the classical spherical codes. We apply this framework to bosonic coding, obtaining multimode extensions of the cat…
Quantum computation with quantum data that can traverse closed timelike curves represents a new physical model of computation. We argue that a model of quantum computation in the presence of closed timelike curves can be formulated which…
The real number system is geometrically extended to include three new anticommuting square roots of plus one, each such root representing the direction of a unit vector along the orthonormal coordinate axes of Euclidean 3-space. The…
The color code is both an interesting example of an exactly solved topologically ordered phase of matter and also among the most promising candidate models to realize fault-tolerant quantum computation with minimal resource overhead. The…
A spherical $L$-code, where $L \subseteq [-1,\infty)$, consists of unit vectors in $\mathbb{R}^d$ whose pairwise inner products are contained in $L$. Determining the maximum cardinality $N_L(d)$ of an $L$-code in $\mathbb{R}^d$ is a…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
We exploit an arbitrary extrinsic time foliation of spacetime to solve the constraints in spherically symmetric general relativity. Among such foliations there is a one parameter family, linear and homogeneous in the extrinsic curvature,…