Related papers: Noncommutative Spherical Codes
This paper provides upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in hyperbolic $\mathbb{H}^n$ and spherical $\mathbb{S}^n$ spaces, for $n\geq 2$. For that purpose, the kissing number is replaced by the…
We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte's linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower…
This article is about a decoding algorithm for error-correcting subspace codes. A version of this algorithm was previously described by Rosenthal, Silberstein and Trautmann. The decoding algorithm requires the code to be defined as the…
Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…
Since Isaac Newton first studied the Kissing Number Problem in 1694, determining the maximal number of non-overlapping spheres around a central sphere has remained a fundamental challenge. This problem is the local analogue of Hilbert's…
We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult…
We give an overview of the applications of noncommutative geometry to physics. Our focus is entirely on the conceptual ideas, rather than on the underlying technicalities. Starting historically from the Heisenberg relations, we will explain…
Noncommutative analogues of n-dimensional balls are defined by repeated application of the quantum double suspension to the classical low-dimensional spaces. In the `even-dimensional' case they correspond to the Twisted Canonical…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
We consider the hyperboloidal initial value problem in numerical relativity, motivated by the goal to evolve radiating compact objects such as black hole binaries with a numerical grid that includes null infinity. Unconstrained evolution…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
Classical differential geometry can be encoded in spectral data, such as Connes' spectral triples, involving supersymmetry algebras. In this paper, we formulate non-commutative geometry in terms of supersymmetric spectral data. This leads…
We develop a framework for obtaining linear programming bounds for spherical codes whose inner products belong to a prescribed subinterval $[\ell,s]$ of $[-1,1)$. An intricate relationship between Levenshtein-type upper bounds on…
It has been known for some time now that error correction plays a fundamental role in the determining the emergence of semiclassical geometry in quantum gravity. In this work I connect several different lines of reasoning to argue that this…
These lecture notes treat the solution of the kissing number problem in four dimesions which is based on an extension of the Delsarte method for spherical codes.
We prove a lower bound of $\Omega (d^{3/2} \cdot (2/\sqrt{3})^d)$ on the kissing number in dimension $d$. This improves the classical lower bound of Chabauty, Shannon, and Wyner by a linear factor in the dimension. We obtain a similar…
A packing of spherical caps on the surface of a sphere (that is, a spherical code) is called rigid or jammed if it is isolated within the space of packings. In other words, aside from applying a global isometry, the packing cannot be…
A quantum code is a subspace of a Hilbert space of a physical system chosen to be correctable against a given class of errors, where information can be encoded. Ideally, the quantum code lies within the ground space of the physical system.…
Proposed in 1954 by Gell-Mann, Goldberger, and Thirring, crossing symmetry postulates that particles are indistinguishable from anti-particles traveling back in time. Its elusive proof amounts to demonstrating that scattering matrices in…
We first review some topics in the classical computational geometry of lines, in particular the O(n^{3+\epsilon}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description…