{
  "id": "1003.3576",
  "version": "v2",
  "published": "2010-03-18T13:07:46.000Z",
  "updated": "2011-02-18T11:43:57.000Z",
  "title": "Combinatorial problems in finite fields and Sidon sets",
  "authors": [
    "Javier Cilleruelo"
  ],
  "comment": "13 pages",
  "categories": [
    "math.NT",
    "math.CO"
  ],
  "abstract": "We use Sidon sets to present an elementary method to study some combinatorial problems in finite fields, such as sum product estimates, solubility of some equations and distribution of sequences in small intervals. We obtain classic and more recent results avoiding the use of exponential sums, the usual tool to deal with these problems.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2011-02-18T11:43:57.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "11B30"
    ],
    "keywords": [
      "finite fields",
      "sidon sets",
      "combinatorial problems",
      "sum product estimates",
      "elementary method"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 13,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1003.3576C"
    }
  }
}