Conlon–Lim's Brunn–Minkowski conjecture for discrete linear sumsets
Conlon–Lim's Brunn–Minkowski conjecture for discrete linear sumsets
Let and let be irreducible and coprime. Let be finite and non-empty. Here, irreducibility means that there are no non-trivial subspaces of the same dimension such that for every , while coprimality means that no satisfy and . Conlon–Lim's conjecture. One has
This conjecture proposes a Brunn–Minkowski-type lower bound for discrete sumsets generated by irreducible, coprime integer linear maps; the source presents it as a conjecture from Conlon–Lim and gives no resolution.
Sources & referencesView supporting material
Primary source
Albert Lopez Bruch, Yifan Jing and Akshat Mudgal, “Brunn-Minkowski type estimates for certain discrete sumsets”, arXiv:2409.05638 (2024).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.