\(B_ 2[g]\) sequences whose terms are squares (Q1804722): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A dense infinite Sidon sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Pseudo-Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: $B_{2}$-sequences whose terms are squares / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01874521 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2084057068 / rank
 
Normal rank

Latest revision as of 10:52, 30 July 2024

scientific article
Language Label Description Also known as
English
\(B_ 2[g]\) sequences whose terms are squares
scientific article

    Statements

    \(B_ 2[g]\) sequences whose terms are squares (English)
    0 references
    0 references
    15 May 1995
    0 references
    Eine Folge natürlicher Zahlen heißt \(B_2 [g]\)-Folge, wenn \(r_n(A) \geq g\) ist für alle \(n \in \mathbb{N}\), wobei \(r_n(A)\) die Anzahl der Darstellungen von \(n\) als \(n = a_i + a_j\) mit \(a_i \leq a_j\) und \(a_i\), \(a_j \in A\) bedeutet. In dieser Arbeit wird gezeigt, daß es für jedes \(\varepsilon > 0\) ein \(g \in \mathbb{N}\) und eine \(B_2 [g]\)-Folge mit Gliedern \(a_k^2\) gibt, so daß gilt \(a_k \ll k^{2 + \varepsilon}\). Zum Beweis wird die wahrscheinlichkeitstheoretische Methode benutzt.
    0 references
    probabilistic method
    0 references
    additive number theory
    0 references
    \(B_ 2\)-sequences
    0 references
    \(B_ 2 [g]\)-sequences
    0 references

    Identifiers