additive combinatorics

短语

释义与例句

n.
  1. 1.

    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 A#43;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.

    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.

词源

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.

来源：wiktionary