Incremental Algorithms for Lattice Problems
Boris Hemkemeier, Frank Vallentin
Abstract
In this short note we give incremental algorithms for the following lattice problems: finding a basis of a lattice, computing the successive minima, and determining the orthogonal decomposition. We prove an upper bound for the number of update steps for every insertion order. For the determination of the orthogonal decomposition we efficiently implement an argument due to Kneser.
Create a lesson
Related papers
Rational points on loxodromic K3 surfaces and complex dynamics
Damián Gvirtz-Chen, Zhizhong Huang, Zhuchao Ji et al.
Ramanujan-type congruences for the smallest parts function
Larry Rolen
Some instances of modularity for residually reducible representations in the mixed case
Luis V. Dieulefait
Classification of torsion of elliptic curves over sextic fields
Filip Najman
A generalization of the Dirichlet approximation theorem for affine actions on the real line
Mohammad Javaheri
On ill-distributed B3 and B4 sets
André Hisatsuga, Rafael Miyazaki, Cosmin Pohoata