English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

A permuted van der Corput sequence Sσ b in base b is a onedimensional, infinite sequence of real numbers in the interval [0, 1), generation of which involves a permutation σ of the set {0, 1, . . . , b−1}. These sequences are known to have low discrepancy DN , i.e. t(S σ b ) := lim supN→∞ DN (S σ b )/ logN is finite. Restricting to prime bases p we present two families of generating permutations. We describe their elements as polynomials over finite fields Fp in an explicit way. We use this characterization to obtain bounds for t(Sσ p ) for permutations σ in these families. We determine the best permutations in our first family and show that all permutations of the second family improve the distribution behavior of classical van der Corput sequences in the sense that t(Sσ p ) < t(S id p ). Communicated by Friedrich Pillichshammer

On the discrepancy of two families of permuted van der Corput sequences