Problems in additive number theory, I

By Melvyn B. Nathanson. 2006

48 citations recorded by the source corpus.

Talk at the Atelier en combinatoire additive (Workshop on Arithmetic Combinatorics) at the Centre de recherches mathématiques at the Université de Montréal on April 8, 2006. Definition 1. A problem is a problem I cannot solve, not necessarily an unsolved problem. 1. Sums and differences For any set A of integers, we define the sumset A + A = {a + a : a, a ∈ A} and the difference set A − A = {a− a : a, a ∈ A}. In this section we consider finite sets of integers, and the relative sizes of their sumsets and difference sets. If A is a finite set of integers and x, y ∈ Z, then the translation of A by x is the set x + A = {x + a : a ∈ A} and the dilation of A by y is y ∗ A = {ya : a ∈ A}. We have (x + A) + (x + A) = 2x + 2A and (x + A) − (x + A) = A − A. Similarly, y ∗ A + y ∗ A = y ∗ (A + A) and y ∗ A − y ∗ A = y ∗ (A − A). It follows that |(x + y ∗ A) + (x + y ∗ A)| = |2A| and |(x + y ∗ A) − (x + y ∗ A)| = |A − A| so the cardinalities of the sum and difference sets of a finite set of integers are invariant under affine transformations of the set. 2000 Mathematics Subject Classification. 11B05, 11B13, 11B34.

Subfields: Algebra and Number Theory, Geometry and Topology, Theoretical Computer Science

View Paper: https://www.semanticscholar.org/paper/a44ffe752f5acbe9fc9223f17cad1311b604ad0c

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Kevin O'Bryant
  2. Greg Martin
  3. Yufei Zhao
  4. Nathan Kaplan

In Geometry and Topology

  1. Kevin O'Bryant
  2. Greg Martin
  3. Yufei Zhao
  4. Nathan Kaplan

In Theoretical Computer Science

  1. Kevin O'Bryant
  2. Greg Martin
  3. Yufei Zhao

Citations in the corpus