Publication

Geometric Considerations in Lattice Programming

Moritz Andreas Venzin
2023
EPFL thesis

Abstract

We provide faster algorithms and fine-grained reductions for lattice problems in general norms.

Official source

https://infoscience.epfl.ch/record/300547?ln=en

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Moments of the number of points in a bounded set for number field lattices

Maryna Viazovska, Nihar Prakash Gargava, Vlad Serban

We examine the moments of the number of lattice points in a fixed ball of volume

V

for lattices in Euclidean space which are modules over the ring of integers of a number field

K

. In particular, denoting by

ω_K

the number of roots of unity in

K

, we ...

arXiv2023

Geometric Considerations in Lattice Programming

Graph Chatbot

Chat with Graph Search

Mean value theorems for collections of lattices with a prescribed group of symmetries

Moments of the number of points in a bounded set for number field lattices

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

Mean value theorems for collections of lattices with a prescribed group of symmetries

BLOOM: Bimodal Lattice One-out-of-Many Proofs and Applications

Moments of the number of points in a bounded set for number field lattices