Positive-definite Functions, Exponential Sums and the Greedy Algorithm: a curious Phenomenon

preprint2020arXivOpen access

Abstract

We describe a curious dynamical system that results in sequences of real numbers in [0,1][0,1] with seemingly remarkable properties. Let the function f:T→Rf:\mathbb{T} \rightarrow \mathbb{R} satisfy f^(k)≥c∣k∣−2\hat{f}(k) \geq c|k|^{-2} and define a sequence via xn=arg⁡min⁡x∑k=1n−1f(x−xk). x_n = \arg\min_x \sum_{k=1}^{n-1}{f(x-x_k)}. Such sequences (xn)n=1∞(x_n)_{n=1}^{\infty} seem to be astonishingly regularly distributed in various ways (satisfying favorable exponential sum estimates; every interval J⊂[0,1]J \subset [0,1] contains ∼∣J∣n\sim |J|n elements). We prove W2(1n∑k=1nδxk,dx)≤cn, W_2\left( \frac{1}{n} \sum_{k=1}^{n}{δ_{x_k}}, dx\right) \leq \frac{c}{\sqrt{n}}, where W2W_2 is the 2-Wasserstein distance. Much stronger results seem to be true and it seems like an interesting problem to understand this dynamical system better. We obtain optimal results in dimension d≥3d \geq 3: using G(x,y)G(x,y) to denote the Green's function of the Laplacian on a compact manifold, we show that $$ x_n = \arg\min_{x \in M} \sum_{k=1}^{n-1}{G(x,x_k)} \quad \mbox{satisfies} \quad W_2\left( \frac{1}{n} \sum_{k=1}^{n}{δ_{x_k}}, dx\right) \lesssim \frac{1}{n^{1/d}}.$$

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.