On the intriguing search for good permutations
From MaRDI portal
Publication:5145776
Abstract: The intriguing search for permutations that generate generalised van der Corput sequences with exceptionally small discrepancy forms an important part of the research work of Henri Faure. On the occasion of Henri's 80th birthday we aim to survey (some of) his contributions over the last four decades which considerably improved our understanding of one-dimensional van der Corput sequences and inspired a lot of related work. We recall and compare the different approaches in the search for generalised van der Corput sequences with low discrepancy, i.e., using a single generating permutation versus using a sequence of permutations. Throughout, we collect, sharpen and extend open questions which all stem from the extensive work of Henri and his coworkers and which will hopefully inspire more work in the future.
Recommendations
Cited in
(7)- Permutations of finite fields and uniform distribution modulo 1
- Good permutations for extreme discrepancy
- Best permutation analysis
- Applying fast simulation to find the number of good permutations
- Greedy energy minimization can count in binary: point charges and the van der Corput sequence
- On Proinov's lower bound for the diaphony
- scientific article; zbMATH DE number 1978940 (Why is no real title available?)
This page was built for publication: On the intriguing search for good permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145776)