On the uniform distribution in residue classes of dense sets of integers with distinct sums (Q1293693): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jnth.1998.2351 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2017728233 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/9808061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorems in the additive theory of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sum sets of Sidon sets. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Problem of Sidon in Additive Number Theory, and on some Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The density of \(B_ h[g]\) sequences and the minimum of dense cosine sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well distribution of Sidon sets in residue classes / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JNTH.1998.2351 / rank
 
Normal rank

Latest revision as of 17:37, 10 December 2024

scientific article
Language Label Description Also known as
English
On the uniform distribution in residue classes of dense sets of integers with distinct sums
scientific article

    Statements

    On the uniform distribution in residue classes of dense sets of integers with distinct sums (English)
    0 references
    4 October 2001
    0 references
    Eine Menge \(A\subseteq \{1,\dots,N\}\) heißt vom Typ \(B_2\) (manchmal auch Sidon-Menge), wenn alle Summen \(a+b\) mit \(a\geq b\) und \(a,b\in A\) verschieden sind. Ferner bedeutet für \(x\in\mathbb{Z}_m\) \[ a(x)= a_m(x):= \biggl |\bigl\{a\in A\mid a\equiv x\pmod m\bigr\} \biggr| \] die Anzahl der Elemente von \(A\) mit Rest \(x\) modulo \(m\). Das Hauptresultat der Arbeit ist Theorem 2: Sei \(A\subseteq \{1,\dots,N\}\) eine \(B_2\) Menge mit \(k=|A |\geq N^{1\over 2}-l\), wobei \(l=l(N) =o(N^{1\over 2})\). Ferner sei \(m=o(N^{1\over 2})\). Dann gilt \[ \left\|a(x)-{k\over m}\right \|_2\leq C\begin{cases} {N^{ 3/8} \over m^{1/4}} \quad & \text{für }1\leq N^{1/4} m^{1/2}\\ {N^{1/4} l^{1/2} \over m^{1/2}} \quad & \text{sonst.} \end{cases} \] Dabei bedeutet \(\|f\|_p= (\sum_{x\in \mathbb{Z}_m}|f(x)|^p)^{1\over p}\) für \(f:\mathbb{Z}_m \to\mathbb{C}\) und \(1\leq p< \infty\). Theorem 2 ist eine Verallgemeinerung eines Ergebnisses von \textit{B. Lindström} [J. Number Theory 69, 197-200 (1998; Zbl 0912.11010)].
    0 references
    Sidon sets
    0 references
    \(B_2\)-sequences
    0 references

    Identifiers