Freiman's volume conjecture with dimension

About 10 years old · traced to

Let k,T,d\binNk,T,d\bin \mathbb{N}, and let c,bc,b satisfy

T=(d+c)k−(d+c+12)+d+b+1,T=(d+c)k-\binom{d+c+1}{2}+d+b+1,

where

1≤c≤k−d−1,0≤b≤k−d−c−1.1\leq c\leq k-d-1,\qquad 0\leq b\leq k-d-c-1.

Here vol⁡(k,T,d)\operatorname{vol}(k,T,d) is the maximum volume of a set of integers of cardinality kk, doubling TT, and additive dimension dd. Freiman's volume conjecture. For these parameters,

vol⁡(k,T,d)=2c−1(k−c+b)+1.\operatorname{vol}(k,T,d)=2^{c-1}(k-c+b)+1.

This refines a conjecture of Freiman by incorporating additive dimension and gives an explicit extremal volume in terms of the doubling parameters. The source does not provide evidence of a resolution.

References

Primary source

Gregory A. Freiman, Oriol Serra and Christoph Spiegel, “Additive Volume of Sets Contained in Few Arithmetic Progressions”, arXiv:1808.08455 (2018).

Additional references

2 papers in this index state this conjecture (2016–2018). The statement above is taken from the most recent of them; the others are arXiv:1608.04916.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.