Search results
Jump to navigation
Jump to search
- ...ian group]]s and [[commutative semigroup]]s with an operation of addition. Additive number theory has close ties to [[combinatorial number theory]] and the [[g ==Additive number theory== ...5 KB (705 words) - 06:32, 4 November 2024
- In [[additive combinatorics]], the '''sumset''' (also called the [[Minkowski addition|Minkowski sum]]) Many of the questions and results of additive combinatorics and [[additive number theory]] can be phrased in terms of sumsets. For example, [[Lagrange ...3 KB (439 words) - 20:29, 27 October 2024
- ...last2=Ginzburg | first2=A. | last3=Ziv | first3=A. | title=Theorem in the additive number theory | journal=Bull. Res. Council Israel | volume=10F | pages=41–4 ...ra (Coordinators of the DocCourse) | title=Combinatorial number theory and additive group theory | url=https://archive.org/details/combinatorialnum00gero_834 | ...5 KB (678 words) - 02:07, 12 May 2025
- {{wikibooks|Combinatorics|Schur's Theorem|Proof of Schur's theorem}} == Combinatorics == ...6 KB (908 words) - 23:17, 19 June 2025
- :Honorable mention: [[Maria Monks]] ([[Combinatorics]] and [[number theory]], [[Massachusetts Institute of Technology]]) :'''Winner:''' [[Maria Monks]] ([[Combinatorics]] and [[number theory]], [[Massachusetts Institute of Technology]])<ref>{{c ...13 KB (1,640 words) - 10:02, 29 June 2025
- {{Short description|Method in enumerative combinatorics}} In the [[mathematics|mathematical]] field of [[enumerative combinatorics]], [[identity (mathematics)|identities]] are sometimes established by argum ...6 KB (899 words) - 12:40, 8 November 2024
- ...lf an area of [[mathematics]], that lies at the intersection of [[extremal combinatorics]] and [[graph theory]]. In essence, extremal graph theory studies how globa |article=Extremal and Probabilistic Combinatorics ...10 KB (1,528 words) - 10:09, 11 June 2025
- * [[Rule of sum]], in combinatorics * [[Zero-sum problem]] in combinatorics ...4 KB (601 words) - 12:25, 27 December 2024
- ...c combinatorics]] (not to be confused with the [[Erdős–Turán conjecture on additive bases]]). It states that if the sum of the reciprocals of the members of a Formally, the conjecture states that if ''A'' is a [[Large set (combinatorics)|large set]] in the sense that ...7 KB (1,017 words) - 05:10, 5 May 2025
- ...e set|countable]] but countable groups need not be finitely generated. The additive group of [[rational number]]s '''Q''' is an example of a countable group th ...]]. Every infinite cyclic group is [[group isomorphism|isomorphic]] to the additive group of the [[Integer#Algebraic properties|integers]] '''Z'''. ...9 KB (1,246 words) - 14:17, 13 November 2024
- A set of integers is said to be [[Small set (combinatorics)|small]] if the sum of its [[Multiplicative inverse|reciprocal]]s [[converg [[Category:Additive combinatorics]] ...5 KB (712 words) - 05:28, 7 February 2025
- * The linear class '''''B''''' is '''additive''', that is, closed under repeated [[symmetric difference]] (when the resul .../view/Surveys ''Electronic Journal of Combinatorics'', Dynamic Surveys in Combinatorics, #DS8]. ...10 KB (1,626 words) - 01:20, 11 January 2025
- | thesis_title = Topics in Arithmetic Combinatorics ...RS]] (born 27 February 1977) is a British mathematician, specialising in [[combinatorics]] and [[number theory]]. He is the [[Waynflete Professor of Pure Mathematic ...13 KB (1,788 words) - 21:47, 14 August 2024
- *{{cite book| last=Nathanson | first=Melvyn B. | year=1996 | title=Additive Number Theory: Inverse Problems and Geometry of Sumsets | volume=165 | seri [[Category:Combinatorics]] ...3 KB (511 words) - 04:04, 20 November 2024
- In [[additive combinatorics]], a discipline within mathematics, '''Freiman's theorem''' is a central re ...ref><ref>{{cite book| last=Nathanson | first=Melvyn B. | year=1996 | title=Additive Number Theory: Inverse Problems and Geometry of Sumsets | volume=165 | seri ...18 KB (2,863 words) - 23:09, 26 May 2025
- | fields = [[Mathematical analysis|Analysis]] and [[Combinatorics]] ...l functions]], [[number theory]], [[mathematical analysis|analysis]] and [[combinatorics]]. ...10 KB (1,300 words) - 06:59, 6 May 2024
- ...92|loc=p. 331}}</ref> If <math>G</math> is an [[abelian group]] written in additive notation, the defining condition is that every non-zero element of <math>G< ..., and is called a '''translate''' of <math>D</math> (<math>D + g</math> in additive notation). ...15 KB (2,328 words) - 15:37, 21 July 2024
- ...rt constant]], in mathematics, an invariant of a group studied in additive combinatorics ...4 KB (559 words) - 16:00, 29 March 2025
- | thesis_title = Extremal Problems in Combinatorics ...or of mathematics at Princeton University noted for his contributions to [[combinatorics]] and [[theoretical computer science]], having authored hundreds of papers. ...16 KB (2,057 words) - 18:44, 16 June 2025
- *[[Additive function]] ==[[Analytic number theory]]: additive problems== ...10 KB (1,034 words) - 18:05, 24 June 2025