Search Results

You are looking at 1 - 1 of 1 items for

  • Author or Editor: Sho Miyamoto x
  • All content x
Clear All Modify Search

For the classical Erdős-Fortet sequence n k = 2k − 1 we show that the law of the iterated logarithm for star discrepancy of {n k x} has non-constant limsup, while the law for discrepancy has constant limsup.

Restricted access