COUNTING BASIS EXTENSIONS IN A LATTICE
Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with supnorm bounded by T, producing an asymptotic estimate as T → ∞. This problem can be interpreted in terms of unimodular matrices, as well as a representation prob...
Main Authors: | Forst, M. (Author), Fukshansky, L. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
American Mathematical Society
2022
|
Subjects: | |
Online Access: | View Fulltext in Publisher |
Similar Items
-
Exploring structure and reformulations in different integer programming algorithms
by: Louveaux, Quentin
Published: (2004) -
Dual Lattice of ℤ-module Lattice
by: Futa Yuichi, et al.
Published: (2017-07-01) -
Segment LLL Reduction of Lattice Bases Using Modular Arithmetic
by: Sanjay Mehrotra, et al.
Published: (2010-07-01) -
Modelling of Lattices of Two-Dimensional Quasi-Crystals
by: V. V. Girzhon, O. V. Smolyakov
Published: (2019-12-01) -
On the Farey sequence and its augmentation for applications to image analysis
by: Pratihar Sanjoy, et al.
Published: (2017-09-01)