An effective proof of Roth's theorem on quadratic dispersion (Q3216741)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3882538
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An effective proof of Roth's theorem on quadratic dispersion |
scientific article; zbMATH DE number 3882538 |
Statements
An effective proof of Roth's theorem on quadratic dispersion (English)
0 references
1984
0 references
irregularities of distribution
0 references
Roth theorem
0 references
quadratic dispersion
0 references
Hammersley-Roth sequence
0 references
effective proof
0 references
0.77398664
0 references
0.7390816
0 references
0.73101103
0 references
0 references
0.7015012
0 references
0.6951568
0 references
Let \(x_ k\) \((k=1,\ldots,N)\) be points in \([0,1)^{s+1}\) and \(Z(N,\alpha)\) be the number of \(x_ k\) lying in \([0,\alpha_ 1)\times\ldots\times [0,\alpha_{s+1})\). Denote by \[ D_ 2(N)=\int^{1}_{0}\ldots\int^{1}_{0}| Z(N,\alpha)-N\alpha_ 1\ldots\alpha_{s+1}|^ 2 \,d\alpha \] the quadratic dispersion. Suppose that \(s\geq 1\), \(N\geq 2\) and \(p_ 1,\ldots,p_ s\) is a fixed set of distinct prime numbers. Set \(h_ j=[\log N/\log p_ j]+1\), \(P_ j=p_ j^{h_ j}\). For each \(j=1,\ldots,s\) and any integer \(n\) one has the \(p_ j\)-expansion of the integer \[ P_ j\{n/P_ j\}=n_ 0^{(j)}+n_ 1^{(j)}p_ j+\ldots+n^{(j)}_{h_ j-1}p_ j^{h_ j-1}. \] Put \(x_ j(n)=n_ 0^{(j)}p_ j^{-1}+\ldots+n^{(j)}_{h_ j-1}p_ j^{- h_ j}\) and for each integer vector \(t=(t_ 1,\ldots,t_ s)\) set \[ x(n,t)=(x_ 1(n+t_ 1),\ldots,x_ s(n+t_ s),n/N)\qquad (n=0,1,\ldots,N-1).\tag{1} \] Denote by \(D_ 2(N,t)\) the quadratic dispersion for (1). On averaging over discrete parameters of the Hammersley-Roth sequence, the author proves the following Theorem. For any \(N\geq 2\) there exists an integer vector \(t_ 0=(t_{10},\ldots,t_{s0})\), such that \(0\leq t_{j0}\leq P_ j-1\) \((j=1,\ldots,s)\) and \[ D_ 2(N,t_ 0)\leq C(s,p_ 1,\ldots,p_ s) (\log N)^ s. \] This gives an effective proof of a theorem of Roth [\textit{K. F. Roth}, Acta Arith. 37, 65--75 (1980; Zbl 0425.10057), Theorem 2].
0 references