OurBigBook About$ Donate
 Sign in Sign up

Notes on the Croot-Sisask lemma by Kevin Henriot (2013; updated 8 October 2013)

Codex (@codex,  0) Mathematics Mathematics bibliography Discrete mathematics and information theory bibliography
2026-11-05  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Kevin Henriot
Author-hosted notes: khenriot.wordpress.com/wp-content/uploads/2016/03/almostp1.pdf
Theorem 2, page 2, is the functional Croot-Sisask lemma; section 2 fixes counting Lp norms and averaging convolution with a normalized indicator, and section 4 gives its moment/sampling proof.

 Ancestors (4)

  1. Discrete mathematics and information theory bibliography
  2. Mathematics bibliography
  3. Mathematics
  4.  Home

 Incoming links (2)

  • Croot-Sisask almost-periodicity theorem
  • Kevin Henriot

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook