Gowers norm

In mathematics, in the field of additive combinatorics, a Gowers norm or uniformity norm is a class of norms on functions on a finite group or group-like object which quantify the amount of structure present, or conversely, the amount of randomness.[1] They are used in the study of arithmetic progressions in the group. They are named after Timothy Gowers, who introduced it in his work on Szemerédi's theorem.[2]

  1. ^ Hartnett, Kevin. "Mathematicians Catch a Pattern by Figuring Out How to Avoid It". Quanta Magazine. Retrieved 2019-11-26.
  2. ^ Gowers, Timothy (2001). "A new proof of Szemerédi's theorem". Geometric & Functional Analysis. 11 (3): 465–588. doi:10.1007/s00039-001-0332-9. MR 1844079. S2CID 124324198.