• Additive combinatorics is an area of combinatorics in mathematics. One major area of study in additive combinatorics are inverse problems: given the size...
    5 KB (762 words) - 00:56, 6 April 2025
  • arithmetic combinatorics in his review of "Additive Combinatorics" by Tao and Vu. Szemerédi's theorem is a result in arithmetic combinatorics concerning...
    9 KB (956 words) - 14:37, 1 February 2025
  • making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is graph...
    33 KB (3,524 words) - 20:02, 6 May 2025
  • Sawhney (Combinatorics, Massachusetts Institute of Technology), Cynthia Stoner (Combinatorics, Harvard University), Ashwin Sah (Combinatorics, Massachusetts...
    13 KB (1,087 words) - 11:38, 11 January 2025
  • Gowers norm (category Additive combinatorics)
    In mathematics, in the field of additive combinatorics, a Gowers norm or uniformity norm is a class of norms on functions on a finite group or group-like...
    7 KB (1,077 words) - 05:41, 1 January 2025
  • Ruzsa triangle inequality (category Additive combinatorics)
    In additive combinatorics, the Ruzsa triangle inequality, also known as the Ruzsa difference triangle inequality to differentiate it from some of its variants...
    5 KB (1,056 words) - 17:29, 8 December 2024
  • the Erdős–Turán conjecture on additive bases. Shapley–Folkman lemma Additive combinatorics Multiplicative combinatorics Multiplicative number theory Nathanson...
    5 KB (605 words) - 06:32, 4 November 2024
  • Restricted sumset (category Additive combinatorics)
    In additive number theory and combinatorics, a restricted sumset has the form S = { a 1 + ⋯ + a n :   a 1 ∈ A 1 , … , a n ∈ A n   a n d   P ( a 1 , … ...
    8 KB (1,309 words) - 06:13, 12 January 2024
  • Szemerédi's theorem (category Additive combinatorics)
    In arithmetic combinatorics, Szemerédi's theorem is a result concerning arithmetic progressions in subsets of the integers. In 1936, Erdős and Turán conjectured...
    22 KB (2,490 words) - 14:21, 12 January 2025
  • Schur's theorem (category Additive combinatorics)
    often called Schur's property, also due to Issai Schur. The Wikibook Combinatorics has a page on the topic of: Proof of Schur's theorem In Ramsey theory...
    6 KB (851 words) - 19:01, 27 November 2024
  • Thumbnail for Extremal graph theory
    graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence...
    10 KB (1,360 words) - 09:43, 1 August 2022
  • Plünnecke–Ruzsa inequality (category Additive combinatorics)
    In additive combinatorics, the Plünnecke–Ruzsa inequality is an inequality that bounds the size of various sumsets of a set B {\displaystyle B} , given...
    15 KB (2,618 words) - 07:52, 19 January 2023
  • Thumbnail for Number theory
    These questions are characteristic of arithmetic combinatorics, a coalescing field that subsumes additive number theory (which concerns itself with certain...
    88 KB (11,250 words) - 19:21, 5 May 2025
  • In additive combinatorics, the sumset (also called the Minkowski sum) of two subsets A {\displaystyle A} and B {\displaystyle B} of an abelian group G...
    3 KB (370 words) - 20:29, 27 October 2024
  • Thumbnail for Terence Tao
    Terence Tao (category Additive combinatorialists)
    partial differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing and...
    79 KB (6,687 words) - 21:03, 22 April 2025
  • Ramsey theory is a branch of mathematics where problems motivated by additive combinatorics are proven using ergodic theory. Ergodic Ramsey theory arose shortly...
    2 KB (250 words) - 00:35, 5 November 2024
  • uncertainty. Additive combinatorics The part of arithmetic combinatorics devoted to the operations of addition and subtraction. Additive number theory...
    71 KB (7,692 words) - 22:32, 2 March 2025
  • ISBN 9783110283600 Green, Ben (2005), "Finite field models in additive combinatorics", Surveys in Combinatorics 2005, Cambridge University Press, pp. 1–28, arXiv:math/0409420...
    45 KB (7,535 words) - 18:07, 22 April 2025
  • Approximate group (category Additive combinatorics)
    was introduced in the 2010s but can be traced to older sources in additive combinatorics. Let G {\displaystyle G} be a group and K ≥ 1 {\displaystyle K\geq...
    8 KB (1,251 words) - 18:51, 17 December 2024
  • (1978), "Triple systems with no six points carrying three triangles", Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, Colloq. Math...
    32 KB (5,077 words) - 23:54, 9 March 2025
  • specialist in harmonic analysis, geometric measure theory, and additive combinatorics Carole Lacampagne, American mathematician known for her work in...
    195 KB (23,258 words) - 22:47, 6 May 2025
  • Green–Tao theorem (category Additive combinatorics)
    "A Multidimensional Szemerédi Theorem in the primes via Combinatorics". Annals of Combinatorics. 22 (4): 711–768. arXiv:1306.3025. doi:10.1007/s00026-018-0402-4...
    13 KB (1,538 words) - 17:30, 10 March 2025
  • In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose...
    18 KB (2,928 words) - 19:20, 3 May 2025
  • Thumbnail for Salem–Spencer set
    Salem–Spencer set (category Additive combinatorics)
    In mathematics, and in particular in arithmetic combinatorics, a Salem-Spencer set is a set of numbers no three of which form an arithmetic progression...
    22 KB (2,612 words) - 18:21, 10 October 2024
  • Thumbnail for Ruixiang Zhang
    Euclidean harmonic analysis, analytic number theory, geometry and additive combinatorics. He is an assistant professor in the Department of Mathematics at...
    4 KB (440 words) - 14:12, 18 April 2025
  • Container method (category Additive combinatorics)
    constraints. Such questions arise naturally in extremal graph theory, additive combinatorics, discrete geometry, coding theory, and Ramsey theory; they include...
    23 KB (4,349 words) - 17:23, 8 December 2024
  • Hilbert’s 10th problem is undecidable for every ring of integers using additive combinatorics. Another team of mathematicians subsequently claimed another proof...
    26 KB (3,277 words) - 07:27, 26 April 2025
  • Nilsequence (category Additive combinatorics)
    type of numerical sequence playing a role in ergodic theory and additive combinatorics. The concept is related to nilpotent Lie groups and almost periodicity...
    10 KB (1,265 words) - 09:48, 9 February 2025
  • Thumbnail for Ben Green (mathematician)
    Green's research is in the fields of analytic number theory and additive combinatorics, but he also has results in harmonic analysis and in group theory...
    13 KB (1,331 words) - 21:47, 14 August 2024
  • descriptions of redirect targets Gowers norm – Class of norms in additive combinatorics Kadec norm – All infinite-dimensional, separable Banach spaces are...
    36 KB (5,937 words) - 20:36, 2 May 2025