"additive combinatorics" meaning in All languages combined

See additive combinatorics on Wiktionary

Noun [English]

Etymology: Coined circa early 2000s by Australian-American mathematician Terence Tao for a rapidly developing field growing out of combinatorial number theory, named differently to reflect a changed emphasis in the problems being studied. Head templates: {{en-noun|-}} additive combinatorics (uncountable)
  1. (mathematics) A subbranch of combinatorics that concerns additive problems expressed using sumsets. Wikipedia link: Ben Green (mathematician), Bulletin of the American Mathematical Society, Centre de Recerca Matemàtica, Imre Z. Ruzsa, Terence Tao, additive combinatorics Tags: uncountable Categories (topical): Mathematics Synonyms (combinatorial number theory): discipline that concerns combinatorics problems expressed using sumsets Related terms: additive number theory, combinatorics
    Sense id: en-additive_combinatorics-en-noun-c6U6NQs~ Categories (other): English entries with incorrect language header, Entries with translation boxes, Pages with 1 entry, Pages with entries Topics: mathematics, sciences
{
  "etymology_text": "Coined circa early 2000s by Australian-American mathematician Terence Tao for a rapidly developing field growing out of combinatorial number theory, named differently to reflect a changed emphasis in the problems being studied.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "additive combinatorics (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Entries with translation boxes",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "One major area of study in additive combinatorics is that of inverse problems: for instance, given the sumset A#x2B;B is small in size, what can we say about the structures of A and B? In the case of integer sumsets, Freiman's theorem provides a partial answer.",
          "type": "example"
        },
        {
          "text": "2007, Andrew Granville, Additive Combinatorics, American Mathematical Society, https://books.google.com.au/books?id=SOVPnwEACAAJ&dq=%22Additive+combinatorics%22&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwj5zJbJ0bLsAhUQX30KHTZYAZwQ6AEwRnoECBwQAg."
        },
        {
          "ref": "2014, Terence Tao, Hilbert's Fifth Problem and Related Topics, American Mathematical Society, page 14:",
          "text": "We now discuss what appears at first glance to be an unrelated topic, namely that of additive combinatorics (and its noncommutative counterpart, multiplicative combinatorics). One of the main objects of study in either additive or multiplicative combinatorics are approximate groups — sets A (typically finite) contained in an additive or multiplicative ambient group G that are \"almost groups\" in the sense that they are \"almost\" closed under either addition or multiplication.",
          "type": "quote"
        },
        {
          "ref": "2016, Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, Taylor & Francis (CRC Press), page xi:",
          "text": "This book deals with additive combinatorics, a vibrant area of current mathematical research. Additive combinatorics—an offspring of combinatorial number theory and additive number theory—can be described as the study of combinatorial properties of sumsets (collections of sums with terms from given subsets) in additive structures.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A subbranch of combinatorics that concerns additive problems expressed using sumsets."
      ],
      "id": "en-additive_combinatorics-en-noun-c6U6NQs~",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "sumset",
          "sumset"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A subbranch of combinatorics that concerns additive problems expressed using sumsets."
      ],
      "related": [
        {
          "word": "additive number theory"
        },
        {
          "word": "combinatorics"
        }
      ],
      "synonyms": [
        {
          "sense": "combinatorial number theory",
          "word": "discipline that concerns combinatorics problems expressed using sumsets"
        }
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Ben Green (mathematician)",
        "Bulletin of the American Mathematical Society",
        "Centre de Recerca Matemàtica",
        "Imre Z. Ruzsa",
        "Terence Tao",
        "additive combinatorics"
      ]
    }
  ],
  "word": "additive combinatorics"
}
{
  "etymology_text": "Coined circa early 2000s by Australian-American mathematician Terence Tao for a rapidly developing field growing out of combinatorial number theory, named differently to reflect a changed emphasis in the problems being studied.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "additive combinatorics (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "additive number theory"
    },
    {
      "word": "combinatorics"
    }
  ],
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "English terms with usage examples",
        "English uncountable nouns",
        "Entries with translation boxes",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "examples": [
        {
          "text": "One major area of study in additive combinatorics is that of inverse problems: for instance, given the sumset A#x2B;B is small in size, what can we say about the structures of A and B? In the case of integer sumsets, Freiman's theorem provides a partial answer.",
          "type": "example"
        },
        {
          "text": "2007, Andrew Granville, Additive Combinatorics, American Mathematical Society, https://books.google.com.au/books?id=SOVPnwEACAAJ&dq=%22Additive+combinatorics%22&hl=en&newbks=1&newbks_redir=0&sa=X&ved=2ahUKEwj5zJbJ0bLsAhUQX30KHTZYAZwQ6AEwRnoECBwQAg."
        },
        {
          "ref": "2014, Terence Tao, Hilbert's Fifth Problem and Related Topics, American Mathematical Society, page 14:",
          "text": "We now discuss what appears at first glance to be an unrelated topic, namely that of additive combinatorics (and its noncommutative counterpart, multiplicative combinatorics). One of the main objects of study in either additive or multiplicative combinatorics are approximate groups — sets A (typically finite) contained in an additive or multiplicative ambient group G that are \"almost groups\" in the sense that they are \"almost\" closed under either addition or multiplication.",
          "type": "quote"
        },
        {
          "ref": "2016, Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, Taylor & Francis (CRC Press), page xi:",
          "text": "This book deals with additive combinatorics, a vibrant area of current mathematical research. Additive combinatorics—an offspring of combinatorial number theory and additive number theory—can be described as the study of combinatorial properties of sumsets (collections of sums with terms from given subsets) in additive structures.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A subbranch of combinatorics that concerns additive problems expressed using sumsets."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "combinatorics",
          "combinatorics"
        ],
        [
          "sumset",
          "sumset"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A subbranch of combinatorics that concerns additive problems expressed using sumsets."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "Ben Green (mathematician)",
        "Bulletin of the American Mathematical Society",
        "Centre de Recerca Matemàtica",
        "Imre Z. Ruzsa",
        "Terence Tao",
        "additive combinatorics"
      ]
    }
  ],
  "synonyms": [
    {
      "sense": "combinatorial number theory",
      "word": "discipline that concerns combinatorics problems expressed using sumsets"
    }
  ],
  "word": "additive combinatorics"
}

Download raw JSONL data for additive combinatorics meaning in All languages combined (3.2kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.