Related papers: A Unified Framework for High-Dimensional Pure Root…
It is well-known that the densest lattice sphere packings also typically have large kissing numbers. The sphere packing density maximization problem is known to have a solution among well-rounded lattices, of which the integer lattice…
Since the invention of the famous LLL algorithm, lattice reduction has been an extremely useful tool in computational number theory. By construction, the LLL algorithm deals with lattices living in a vector space endowed with a positive…
Sketch-and-project is a framework which unifies many known iterative methods for solving linear systems and their variants, as well as further extensions to non-linear optimization problems. It includes popular methods such as randomized…
A Graph of Convex Sets (GCS) is a graph in which vertices are associated with convex programs and edges couple pairs of programs through additional convex costs and constraints. Any optimization problem over an ordinary weighted graph…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…
This article considers the relation between the spanning properties of lattice orbits of discrete series representations and the associated lattice co-volume. The focus is on the density theorem, which provides a trichotomy characterizing…
We briefly report on a previously found new, approximate, solution to Einstein field equations, describing a cubic lattice of spherical masses. This model mimics in a satisfactory way a Universe which can be strongly inhomogeneous at small…
In the last decade, progress on quantization of homogeneous cosmological spacetimes using techniques of loop quantum gravity has led to insights on various fundamental questions and has opened new avenues to explore Planck scale physics.…
We study locality-sensitive hash methods for the nearest neighbor problem for the angular distance, focusing on the approach of first projecting down onto a low-dimensional subspace, and then partitioning the projected vectors according to…
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…
We consider vacuum static spherically symmetric solutions in the hybrid metric-Palatini gravity theory, which is a combination of the metric and Palatini $f(R)$ formalisms unifying local constraints at the Solar System level and the…
Sketching techniques have gained popularity in numerical linear algebra to accelerate the solution of least squares problems. The so-called $\varepsilon$-subspace embedding property of a sketching matrix $S$ has been largely used to…
This paper discusses a few algorithms for updating the approximate Singular Value Decomposition (SVD) in the context of information retrieval by Latent Semantic Indexing (LSI) methods. A unifying framework is considered which is based on…
We analyse spherically symmetric spacetimes obtained by gluing a cosmological region to a Schwarzschild black hole across a singular co-dimension one hypersurface. Assuming an arbitrary homogeneous and isotropic cosmology, and working in…
Sampling-based methods for motion planning, which capture the structure of the robot's free space via (typically random) sampling, have gained popularity due to their scalability, simplicity, and for offering global guarantees, such as…
We offer a new, physically transparent argument for the existence of the critical, universal maximum matter density in loop quantum cosmology for the case of a flat Friedmann-Lemaitre-Robertson-Walker cosmology with scalar matter. The…
I conjecture that a flat 10D compact universe emerged out of nothing (By ``nothing'' I mean no notion of space and time) with all it's symmetries intact: Poincare invariance, conformal invariance and supersymmetry, it's massless moduli…
In this letter, we study the implications of precise gauge coupling unification on supersymmetric particle masses. We argue that precise unification favors the superpartner masses that are in the range of several TeV and well beyond. We…
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type structure, where the target vectors are boundably short. For…