“…Recently Gowers [13,14] defined a hypergraph version of this norm, and subsequently he [12] and Nagle, Rödl, Schacht, and Skokan [22,26,25] independently established a hypergraph regularity lemma which easily implies Szemerédi's theorem in its full generality, and even stronger theorems such as Furstenberg-Katznelson's multi-dimensional arithmetic progression theorem [24,9], a result that the only known proof for it at the time was through ergodic theory [11]. In fact arithmetic version of the Gowers norm has interesting interpretations in ergodic theory, and has been studied from that aspect [19]. The discovery of this norm led to a better understanding of the concept of quasirandomness, and provided strong tools.…”