Publications associées à New Results in Integer and Lattice Programming

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos 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

New Results in Integer and Lattice Programming

Graph Chatbot

Chattez avec Graph Search

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

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

Additive and geometric transversality of fractal sets in the integers

Isogeny Problems with Level Structure

Results on Sparse Integer Programming and Geometric Independent Sets

Approximation Algorithms for Allocation and Network Design

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

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Geometric Considerations in Lattice Programming

The double exponential runtime is tight for 2-stage stochastic ILPs

SPEEDING UP KRYLOV SUBSPACE METHODS FOR COMPUTING f(A)b VIA RANDOMIZATION

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

Isogeny Problems with Level Structure

Results on Sparse Integer Programming and Geometric Independent Sets

Additive and geometric transversality of fractal sets in the integers

The double exponential runtime is tight for 2-stage stochastic ILPs

Approximation Algorithms for Allocation and Network Design

Geometric Considerations in Lattice Programming

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

Certification of Bottleneck Task Assignment With Shortest Path Criteria