# An Inequality for Gaussians on Lattices

@article{Regev2017AnIF,
title={An Inequality for Gaussians on Lattices},
author={Oded Regev and Noah Stephens-Davidowitz},
journal={SIAM J. Discret. Math.},
year={2017},
volume={31},
pages={749-757}
}
• Published 17 February 2015
• Mathematics, Computer Science
• SIAM J. Discret. Math.

## Figures from this paper

### Euclidean lattices, theta invariants, and thermodynamic formalism

These are the notes of lectures delivered at Grenoble's summer school on \emph{Arakelov Geo\-me\-try and Diophantine Applications}, in June 2017. They constitute an introduction to the study of

### Minimal Soft Lattice Theta Functions

We study the minimality properties of a new type of “soft” theta functions. For a lattice $$L\subset {\mathbb {R}}^d$$ L ⊂ R d , an L -periodic distribution of mass $$\mu _L$$ μ L , and another mass

### Dimension reduction techniques for the minimization of theta functions on lattices

• Computer Science, Mathematics
• 2016
It is shown how to reduce dimension by considering layered lattices, by considering lattices with a product structure or by successively minimizing over concentric layers, which is relevant for asymptotics questions, which are studied in detail in two dimensions.

### Discrete Gaussian Sampling Reduces to CVP and SVP

There is a simple reduction from CVP to DGS, so this shows that DGS is equivalent to CVP, and it is shown that the CVP result extends to a much wider class of distributions and even to other norms.

### A Counterexample to Monotonicity of Relative Mass in Random Walks

• Mathematics
• 2015
For a finite undirected graph $G = (V,E)$, let $p_{u,v}(t)$ denote the probability that a continuous-time random walk starting at vertex $u$ is in $v$ at time $t$. In this note we give an example of

### An inequality for the heat kernel on an Abelian Cayley graph

We demonstrate a relationship between the heat kernel on a finite weighted Abelian Cayley graph and Gaussian functions on lattices. This can be used to prove a new inequality for the heat kernel on

### Just Take the Average! An Embarrassingly Simple $2^n$-Time Algorithm for SVP (and CVP)

• Computer Science
SOSA
• 2018
A algorithm for the Shortest Vector Problem on lattices (SVP) that works by repeatedly running an embarrassingly simple "pair and average" sieving-like procedure on a list of lattice vectors that matches the running time of the current fastest known algorithm.

### On the Gaussian Measure Over Lattices

We study the Gaussian mass of a lattice coset ρs(L − t) := ∑ y∈L exp(−π‖y − t‖/s) , where L ⊂ R is a lattice and t ∈ R is a vector describing a shift of the lattice. In particular, we use bounds on

### Towards Strong Reverse Minkowski-Type Inequalities for Lattices

• Mathematics
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
• 2016
A natural reverse Minkowski-type inequality for lattices is presented, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and implies the l2 case of the Kannan and Lovasz conjecture.

### Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!

• Computer Science, Mathematics
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
A 2n+o(n)-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on n-dimensional Euclidean lattices and it is shown that the approximate closest vectors to a target vector t can be grouped into “lower-dimensional clusters,” and the discrete Gaussian sampling algorithm can be used to solve this variant of approximate CVP.

## References

SHOWING 1-10 OF 27 REFERENCES

### A Counterexample to Monotonicity of Relative Mass in Random Walks

• Mathematics
• 2015
For a finite undirected graph $G = (V,E)$, let $p_{u,v}(t)$ denote the probability that a continuous-time random walk starting at vertex $u$ is in $v$ at time $t$. In this note we give an example of

### An inequality for the heat kernel on an Abelian Cayley graph

We demonstrate a relationship between the heat kernel on a finite weighted Abelian Cayley graph and Gaussian functions on lattices. This can be used to prove a new inequality for the heat kernel on

### Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again!

• Computer Science, Mathematics
2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
A 2n+o(n)-time and space randomized algorithm for solving the exact Closest Vector Problem (CVP) on n-dimensional Euclidean lattices and it is shown that the approximate closest vectors to a target vector t can be grouped into “lower-dimensional clusters,” and the discrete Gaussian sampling algorithm can be used to solve this variant of approximate CVP.

### New bounds in some transference theorems in the geometry of numbers

The aim of this paper is to give new bounds in certain inequalities concerning mutually reciprocal lattices in R". To formulate the problem, we have to introduce some notation and terminology. We

### A reverse Minkowski theorem

• Mathematics
STOC
• 2017
We prove a conjecture due to Dadush, showing that if ℒ⊂ ℝn is a lattice such that det(ℒ′) 1 for all sublattices ℒ′ ⊆ ℒ, then $$\sum_{y∈ℒ}^e-t2||y||2≤3/2,$$ where t := 10(logn + 2). From this we also

### The Euclidean Distortion of Flat Tori

• Mathematics, Computer Science
APPROX-RANDOM
• 2010
It is shown that for every n-dimensional lattice L the torus Rn/L can be embedded with distortion O(nċ√logn) into a Hilbert space and improves the exponential upper bound of O( n3n/2) and gets close to their lower bound of Ω(√n).

### Fourier transforms with only real zeros

The class of even, nonnegative, finite measures p on the real line such that for any b > 0 the Fourier transform of exp(bt2) dp(t) has only real zeros is completely determined. This result is then

### ON THE GAUSSIAN MEASURE OF THE INTERSECTION

• Mathematics
• 1998
The Gaussian correlation conjecture states that for any two symmetric, convex sets in n-dimensional space and for any centered, Gaussian measure on that space, the measure of the intersection is

### Worst-case to average-case reductions based on Gaussian measures

• Computer Science, Mathematics
45th Annual IEEE Symposium on Foundations of Computer Science
• 2004
It is shown that solving modular linear equation on the average is at least as hard as approximating several lattice problems in the worst case within a factor almost linear in the rank of the lattice, and it is proved that the distribution that one obtains after adding Gaussian noise to the lattices has the following interesting property.

### On the Closest Vector Problem with a Distance Guarantee

• Computer Science
2014 IEEE 29th Conference on Computational Complexity (CCC)
• 2014
A substantially more efficient variant of the LLM algorithm is presented, and via an improved analysis, it is shown that it can decode up to a distance proportional to the reciprocal of the smoothing parameter of the dual lattice.