Sublattices of finite index
Chunlei Liu
Abstract
Assuming the Gowers Inverse conjecture and the Möbius conjecture for the finite parameter s, Green-Tao verified Dickson's conjecture for lattices which are ranges of linear maps of complexity at most s. In this paper, we reformulate Green-Tao's theorem on Dickson's conjecture, and prove that, if L is the range of a linear map of complexity s, and L1 is a sublattice of L of finite index, then L1 is the range of a linear map of complexity s.
Create a lesson
Related papers
Value distribution of multiplicative functions along linear fractional sequences
Sun-Kai Leung
Delta theory of Anderson Modules II: Hodge-Pink structure
Sudip Pandit, Arnab Saha
Integers divisible by a shifted prime in a given interval
Rebecca Abi Abdallah, Valeriya Kovaleva, Jeremy Schlitt et al.
On Piatetski-Shapiro primes from almost primes
Yuhua Zhao, Jinjiang Li, Linji Long et al.
On Consecutive Non-primitive Elements over Finite Fields
Bidushi Sharma, Dhiren Kumar Basnet
Birch's theorem over function fields with quadratically many variables
Matthew Hase-Liu