Dynamically defined sequences with small discrepancy

From MaRDI portal
Publication:2297588

DOI10.1007/S00605-019-01360-ZzbMATH Open1471.11222arXiv1902.03269OpenAlexW2997090937WikidataQ126418683 ScholiaQ126418683MaRDI QIDQ2297588FDOQ2297588


Authors: Stefan Steinerberger Edit this on Wikidata


Publication date: 20 February 2020

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Abstract: We study the problem of constructing sequences (xn)n=1infty on [0,1] in such a way that D_N^* = sup_{0 leq x leq 1} left| frac{ left{1 leq i leq N: x_i leq x ight}}{N} - x ight| is uniformly small. A result of Schmidt shows that necessarily DNgtrsim(logN)N1 for infinitely many N and there are several classical constructions attaining this growth. We describe a type of uniformly distributed sequence that seems to be completely novel: given leftx1,dots,xN1ight, we construct xN in a greedy manner x_N = argmin_{min_k |x-x_k| geq N^{-10}} sum_{k=1}^{N-1}{1-log{(2sin{(pi |x-x_k|)})}}. We prove that DNlesssim(logN)N1/2 and conjecture that DNlesssim(logN)N1. Numerical examples illustrate this conjecture in a very impressive manner. We also establish a discrepancy bound DNlesssim(logN)dN1/2 for an analogous construction in higher dimensions and conjecture it to be DNlesssim(logN)dN1.


Full work available at URL: https://arxiv.org/abs/1902.03269




Recommendations




Cites Work


Cited In (11)





This page was built for publication: Dynamically defined sequences with small discrepancy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297588)