Related papers: Good Distance Lattices from High Dimensional Expan…
We formulate a series of conjectures relating the geometry of conformal manifolds to the spectrum of local operators in conformal field theories in $d>2$ spacetime dimensions. We focus on conformal manifolds with limiting points at infinite…
Accurate and precise astronomical distance determinations are crucial for derivations of, among others, the masses and luminosities of a large variety of distant objects. Astronomical distance determination has traditionally relied on the…
We present a new explicit construction of onesided bipartite lossless expanders of constant degree, with arbitrary constant ratio between the sizes of the two vertex sets. Our construction is simpler to state and analyze than the only prior…
We consider the problem of digitalizing Euclidean segments. Specifically, we look for a constructive method to connect any two points in $\mathbb{Z}^d$. The construction must be {\em consistent} (that is, satisfy the natural extension of…
If C is a binary linear code, let C^2 be the linear code spanned by intersections of pairs of codewords of C. We construct an asymptotically good family of binary linear codes such that, for C ranging in this family, the C^2 also form an…
The positivity of the Bondi mass has been proven in 4 dimensions, but in higher dimensions the issue remains open. The formalism of the present paper has been developed to investigate this and is well suited to the higher dimensional case.…
We quantify the topological expansion properties of bounded degree simplicial complexes in terms of a family of sublinear functions, in analogy with the separation profile of Benjamini-Schramm-Tim\'ar for classical expansion of bounded…
We introduce a high-dimensional cubical complex, for any dimension t>0, and apply it to the design of quantum locally testable codes. Our complex is a natural generalization of the constructions by Panteleev and Kalachev and by Dinur et. al…
We present new constructions of quantum codes of linear or close-to-linear distance and dimension with low-weight stabilizers. Only a few constructions of such codes were previously known, and were primarily based on a specific operation…
Recent works have shown that expansion of pseudorandom sets is of great importance. However, all current works on pseudorandom sets are limited only to product (or approximate product) spaces, where Fourier Analysis methods could be…
We show that there are well separated families of quantum expanders with asymptotically the maximal cardinality allowed by a known upper bound. This has applications to the "growth" of certain operator spaces: It implies asymptotically…
We prove that every lattice with more than one element has a proper congruence-preserving extension.
This paper studies the lattice agreement problem and proposes a stronger form, $\varepsilon$-bounded lattice agreement, that enforces an additional tightness constraint on the outputs. To formalize the concept, we define a quasi-metric on…
We show that two uniform lattices of a regular right-angled Fuchsian building are commensurable, provided the chamber is a polygon with at least six edges. We show that in an arbitrary Gromov-hyperbolic regular right-angled building…
We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…
The problem of constructing lattices such that their quantization noise approaches a desired distribution is studied. It is shown that asymptotically is the dimension, lattice quantization noise can approach a broad family of distribution…
In the following paper we continue the work of Bimonte-Lizzi-Sparano on distances on a one dimensional lattice. We succeed in proving analytically the exact formulae for such distances. We find that the distance to an even point on the…
We explicitly construct several Poisson structures with compact support. For example, we show that any Poisson structure on $\R^n$ with polynomial coefficients of degree at most two can be modified outside an open ball, such that it becomes…
A geometrically local quantum code is an error correcting code situated within $\mathbb{R}^D$, where the checks only act on qubits within a fixed spatial distance. The main question is: What is the optimal dimension and distance for a…
We construct a nonlinear lattice that has a particular symmetry in its potential function consisting of long-range pairwise interactions. The symmetry enhances smooth propagation of discrete breathers, and it is defined by an invariance of…