Counting basis extensions in a lattice

From MaRDI portal
Publication:5097308

DOI10.1090/PROC/16011zbMATH Open1501.11069arXiv2011.05307OpenAlexW4214861744MaRDI QIDQ5097308FDOQ5097308


Authors: Maxwell Forst, Lenny Fukshansky Edit this on Wikidata


Publication date: 23 August 2022

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: 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 sup-norm bounded by T, producing an asymptotic estimate as Toinfty. This problem can be interpreted in terms of unimodular matrices, as well as a representation problem for a class of multilinear forms. In the 2-dimensional case, this problem is also connected to the distribution of Farey fractions. As an auxiliary lemma we prove a counting estimate for the number of integer lattice points of bounded sup-norm in a hyperplane in~mathbbRn. Our main result on counting basis extensions also generalizes to arbitrary lattices in~mathbbRn. Finally, we establish some basic properties of sparse representations of integers by multilinear forms.


Full work available at URL: https://arxiv.org/abs/2011.05307




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Counting basis extensions in a lattice

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