PlumX Metrics
Embed PlumX Metrics

Sharp threshold asymptotics for the emergence of additive bases

Integers: Annual Volume 2013, Page: 195-211
2014
  • 0
    Citations
  • 2
    Usage
  • 1
    Captures
  • 0
    Mentions
  • 0
    Social Media
Metric Options:   Counts1 Year3 Year

Metrics Details

Book Chapter Description

A set A ⊆ [n] ∪ {0} is said to be a 2-additive basis for [n] if each j ∈ [n] can be written as j = x + y, x, y ∈ A, x ≤ y. If we pick each integer in [n] ∪ {0} independently with probability p = p → 0, thus getting a random set A, what is the probability that we have obtained a 2-additive basis? We address this question when the target sum-set is [(1 - α)n, (1 + α)n] (or equivalently [αn, (2 - α)n]) for some 0 < α < 1. We use a delicate application of Janson's correlation inequalities in conjuction with the Stein-Chen method of Poisson approximation to tease out a very sharp threshold for the emergence of a 2-additive basis. Generalizations to k-additive bases are then given.

Provide Feedback

Have ideas for a new metric? Would you like to see something else here?Let us know