Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Journals
  3. Combinatorics, Probability and Computing
  4. Volume 20
Journal Home
Refine listing

Refine listing

Access:
Publication date:

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×
< Back to all issues

Volume 20 - January 2011

Contents

Page 4 of 4

Back Cover (IBC, OBC) and matter

  • CPC volume 20 issue 2 Cover and Back matter

  • Published online by Cambridge University Press:
    28 January 2011, pp. b1-b2
    • Article
      • You have access
    • PDF
    • Export citation

  • CPC volume 20 issue 6 Cover and Back matter

  • Published online by Cambridge University Press:
    27 October 2011, pp. b1-b4
    • Article
      • You have access
    • PDF
    • Export citation

  • CPC volume 20 issue 3 Cover and Back matter

  • Published online by Cambridge University Press:
    23 March 2011, pp. b1-b2
    • Article
      • You have access
    • PDF
    • Export citation

Paper

  • On the Distribution of Three-Term Arithmetic Progressions in Sparse Subsets of Fpn

  • HOI H. NGUYEN
  • Published online by Cambridge University Press:
    18 August 2011, pp. 777-791

  • We give a short proof of the following result on the distribution of three-term arithmetic progressions in sparse subsets of Fpn. For every α > 0 there exists a constant C = C(α) such that the following holds for all r ≥ Cpn/2 and for almost all sets R of size r of Fpn. Let A be any subset of R of size at least αr; then A contains a non-trivial three-term arithmetic progression. This is an analogue of a hard theorem by Kohayakawa, Łuczak and Rödl. The proof uses a version of Green's regularity lemma for subsets of a typical random set, which is of interest in its own right.

Front Cover (OFC, IFC) and matter

  • CPC volume 20 issue 1 Cover and Front matter

  • Published online by Cambridge University Press:
    03 December 2010, pp. f1-f2
    • Article
      • You have access
    • PDF
    • Export citation

  • CPC volume 20 issue 4 Cover and Front matter

  • Published online by Cambridge University Press:
    31 May 2011, pp. f1-f2
    • Article
      • You have access
    • PDF
    • Export citation

Back Cover (IBC, OBC) and matter

  • CPC volume 20 issue 4 Cover and Back matter

  • Published online by Cambridge University Press:
    31 May 2011, pp. b1-b2
    • Article
      • You have access
    • PDF
    • Export citation

Paper

Back Cover (IBC, OBC) and matter

  • CPC volume 20 issue 1 Cover and Back matter

  • Published online by Cambridge University Press:
    03 December 2010, pp. b1-b2
    • Article
      • You have access
    • PDF
    • Export citation

Front Cover (OFC, IFC) and matter

  • CPC volume 20 issue 5 Cover and Front matter

  • Published online by Cambridge University Press:
    18 August 2011, pp. f1-f2
    • Article
      • You have access
    • PDF
    • Export citation

Back Cover (IBC, OBC) and matter

  • CPC volume 20 issue 5 Cover and Back matter

  • Published online by Cambridge University Press:
    18 August 2011, pp. b1-b4
    • Article
      • You have access
    • PDF
    • Export citation

Page 4 of 4