Sums of distances to the nearest integer and the discrepancy of digital nets

G. Larcher; F. Pillichshammer

Displaying similar documents to “Sums of distances to the nearest integer and the discrepancy of digital nets”

Improved upper bounds for the star discrepancy of digital nets in dimension 3

Friedrich Pillichshammer (2003)

Acta Arithmetica

Similarity:

Constructions of digital nets

Harald Niederreiter, Chaoping Xing (2002)

Acta Arithmetica

Similarity:

On existence and discrepancy of certain digital Niederreiter-Halton sequences

Roswitha Hofer, Gerhard Larcher (2010)

Acta Arithmetica

Similarity:

Optimal 𝓛₂ discrepancy bounds for higher order digital sequences over the finite field 𝔽₂

Josef Dick, Friedrich Pillichshammer (2014)

Acta Arithmetica

Similarity:

Unification of zero-sum problems, subset sums and covers of $ℤ$ .

Sun, Zhiwei (2003)

Electronic Research Announcements of the American Mathematical Society [electronic only]

Similarity:

Restricted sums of subsets of ℤ

Zhi-Wei Sun (2001)

Acta Arithmetica

Similarity:

A generalization of NUT digital (0,1)-sequences and best possible lower bounds for star discrepancy

Henri Faure, Friedrich Pillichshammer (2013)

Acta Arithmetica

Similarity:

In uniform distribution theory, discrepancy is a quantitative measure for the irregularity of distribution of a sequence modulo one. At the moment the concept of digital (t,s)-sequences as introduced by Niederreiter provides the most powerful constructions of s-dimensional sequences with low discrepancy. In one dimension, recently Faure proved exact formulas for different notions of discrepancy for the subclass of NUT digital (0,1)-sequences. It is the aim of this paper to generalize...