Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Generalized asymptotic Sidon basis - MaRDI portal

Generalized asymptotic Sidon basis (Q2214059)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Generalized asymptotic Sidon basis
scientific article

    Statements

    Generalized asymptotic Sidon basis (English)
    0 references
    4 December 2020
    0 references
    Let \(h, k \geq 2\) be integers. A set \(A\) of positive integers is an asymptotic basis of order \(k\) if every large enough positive integer can be represented as the sum of \(k\) terms from \(A\). Finally, a set of positive integers \(A\) is called a \(B_h[g]\) set if every positive integer can be represented as the sum of \(h\) terms from \(A\) in at most \(g\) different ways of the form \(a_1+a_2+\dots+a_h\) where \(a_1 \leq a_2 \leq \dots \leq a_h\). Sidon bases from the title correspond to \(B_2[1]\). The authors prove the existence of \(B_h [1]\) sets which are asymptotic bases of order \(2h+1\) using the probabilistic method à la P. Erdős and A. Rényi.
    0 references
    additive number theory
    0 references
    asymptotic basis of order \(k\)
    0 references
    additive representation function
    0 references
    Sidon sets
    0 references
    probability measure
    0 references
    expectation of a random variable
    0 references
    Borel-Cantelli lemma
    0 references
    0 references
    0 references

    Identifiers