英和和英

名詞

additive combinatorics (uncountable)

1. (mathematics) A subbranch of combinatorics that concerns additive problems expressed using sumsets.

   One major area of study in additive combinatorics is that of inverse problems: for instance, given the sumset ${\displaystyle A+B}$ is small in size, what can we say about the structures of ${\displaystyle A}$ and ${\displaystyle B}$? In the case of integer sumsets, Freiman's theorem provides a partial answer.

   • 2007, Andrew Granville, Additive Combinatorics, American Mathematical Society, [1].
   • 2014, Terence Tao, Hilbert's Fifth Problem and Related Topics, American Mathematical Society, page 14,

     We now discuss what appears at first glance to be an unrelated topic, namely that of additive combinatorics (かつ its noncommutative counterpart, multiplicative combinatorics). One of the main objects of study in either additive or multiplicative combinatorics are approximate groups — sets ${\displaystyle A}$ (typically finite) contained in an additive or multiplicative ambient group ${\displaystyle G}$ that are "almost groups" in the sense that they are "almost" closed under either addition or multiplication.

   • 2016, Bela Bajnok, Additive Combinatorics: A Menu of Research Problems, Taylor & Francis (CRC Press), page xi,

     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.

同意語

• (discipline that concerns combinatorics problems expressed using sumsets): combinatorial number theory

参考

• additive number theory
• combinatorics

参照