An optimization problem for lattices

DOI10.1080/10586458.2013.833489MaRDI QIDQ5415568zbMATH OpenOpenAlexFDO

Authors Lajos Hajdu, Tünde Kovács, Attila Pethő, Michael E. Pohst

Publication date 13 May 2014

Published in Experimental Mathematics (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2437/197650

zbMATH Keywords

latticesbasis reductionLLL-reductiondual latticesbases of lattices

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Reduction of lattice bases for arbitrary norms
• On the standard lattices
• Algorithms for the densest sub-lattice problem
• Generalized optimal lattice covering of finite-dimensional Euclidean space
• Simultaneously good bases of a lattice and its reciprocal lattice

Cites work

• scientific article; zbMATH DE number 3316189 (Why is no real title available?)
• Covering minima and lattice-point-free convex bodies
• Factoring polynomials with rational coefficients
• Minimal Determinants and Lattice Inequalities
• The Magma algebra system. I: The user language

Cited in

(2)

• On the standard lattices
• Boolean algebra on region crossing change and an inequality of the region unknotting number

This page was built for publication: An optimization problem for lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415568)