Geometric Considerations in Lattice Programming

Moritz Andreas Venzin
2023
Thèse EPFL

Résumé

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

Source officielle

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

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

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

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

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

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