Sublattices of finite index
arXiv:math/0612439
Abstract
Assuming the Gowers Inverse conjecture and the Möbius conjecture for the finite parameter , Green-Tao verified Dickson's conjecture for lattices which are ranges of linear maps of complexity at most . In this paper, we reformulate Green-Tao's theorem on Dickson's conjecture, and prove that, if is the range of a linear map of complexity , and is a sublattice of of finite index, then is the range of a linear map of complexity .
Revised on Jan. 5, 2007