English

An explicit upper bound for the Helfgott delta in SL(2,p)

Group Theory 2014-11-24 v2 Combinatorics

Abstract

Helfgott proved that there exists a δ>0\delta>0 such that if SS is a symmetric generating subset of SL(2,p)SL(2,p) containing 1 then either S3=SL(2,p)S^3=SL(2,p) or S3S1+δ|S^3|\geq |S|^{1+\delta}. It is known that δ1/3024\delta\geq 1/3024. Here we show that δ(log2(7)1)/60.3012\delta\leq(\log_2(7)-1)/6 \approx 0.3012 and we present evidence suggesting that this might be the true value of δ\delta.

Keywords

Cite

@article{arxiv.1401.2863,
  title  = {An explicit upper bound for the Helfgott delta in SL(2,p)},
  author = {Jack Button and Colva Roney-Dougal},
  journal= {arXiv preprint arXiv:1401.2863},
  year   = {2014}
}

Comments

20 pages, 0 figures, accepted version

R2 v1 2026-06-22T02:44:05.374Z