Dynamically defined sequences with small discrepancy
From MaRDI portal
Publication:2297588
Abstract: We study the problem of constructing sequences on 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 for infinitely many and there are several classical constructions attaining this growth. We describe a type of uniformly distributed sequence that seems to be completely novel: given , we construct 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 and conjecture that . Numerical examples illustrate this conjecture in a very impressive manner. We also establish a discrepancy bound for an analogous construction in higher dimensions and conjecture it to be .
Recommendations
- scientific article; zbMATH DE number 5286803
- Counting sequences with small discrepancies
- Discrepancy of sequences generated by dynamical system
- Low-discrepancy and low-dispersion sequences
- The dynamical point of view of low-discrepancy sequences
- Dynamic realizations of sufficient sequences
- On rapidly varying sequences
Cites work
- scientific article; zbMATH DE number 4130488 (Why is no real title available?)
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 3719241 (Why is no real title available?)
- scientific article; zbMATH DE number 699709 (Why is no real title available?)
- scientific article; zbMATH DE number 1528185 (Why is no real title available?)
- scientific article; zbMATH DE number 4000052 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3096356 (Why is no real title available?)
- A nonlocal functional promoting low-discrepancy point sets
- An improved bound for the star discrepancy of sequences in the unit interval
- General and refined Montgomery lemmata
- Greedy energy minimization can count in binary: point charges and the van der Corput sequence
- Irregularities of distribution, VII
- Minoration de la discrépance d'une suite quelconque sur T
- On irregularities of distribution
- On the small ball inequality in all dimensions
- On the small ball inequality in three dimensions
- Poissonian pair correlation and discrepancy
- Roth's orthogonal function method in discrepancy theory and some new connections
- Sequences, discrepancies and applications
Cited in
(11)- Sequences of well-distributed vertices on graphs and spectral bounds on optimal transport
- On combinatorial properties of greedy Wasserstein minimization
- Positive-definite functions, exponential sums and the greedy algorithm: a curious phenomenon
- scientific article; zbMATH DE number 5286803 (Why is no real title available?)
- Sums of distances on graphs and embeddings into Euclidean space
- Greedy energy minimization can count in binary: point charges and the van der Corput sequence
- Suites dont la discrépance est comparable à un logarithme. (Sequences whose discrepancy is like a logarithm)
- POLYNOMIALS WITH ZEROS ON THE UNIT CIRCLE: REGULARITY OF LEJA SEQUENCES
- The power of online thinning in reducing discrepancy
- Uniformly distributed sequences generated by a greedy minimization of the \(L_2\) discrepancy
- On the Wasserstein distance between classical sequences and the Lebesgue measure
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)