On the discrepancy of (0,1)-sequences

We give bounds for the L^p-discrepancy, , of the van der Corput sequence in base 2. Further, we give a best possible upper bound for the star discrepancy of (0,1)-sequences and show that this bound is attained for the van der Corput sequence. Finally, we give a (0,1)-sequence with essentially smaller star discrepancy than for the van der Corput sequence.     

A thorough analysis of the discrepancy of shifted Hammersley and van der Corput point sets

We study the star discrepancy of Hammersley nets and van der Corput sequences which are important examples of low-dimensional quasi-Monte Carlo point sets. By a so-called digital shift, the quality of distribution of these point sets can be improved. In this paper, we advance and extend existing bounds on digitally shifted Hammersley and van der Corput point sets and establish criteria for the choice of digital shifts leading to optimal results. Our investigations are partly based on a close analysis of certain sums of distances to the nearest integer. Mathematics Subject Classi cation (2000) 11K38; 11K09     

Pseudo-randomness of van der Corput’s sequences

The aim of this paper is to find main terms of the star D _N ^* and extremal D _N discrepancies of the two dimensional sequence (x _n , x _n+1), n = 0, 1, 2, ..., N − 1, where x _n , n = 0, 1, 2, ..., is the van der Corput sequence. This give a quantitative form of a well-known result that van der Corput sequence is not pseudorandom. This research was supported by the Slovak Academy of Sciences Vega Grant No. 2/7138/27.     

An example of an almost greedy uniformly bounded orthonormal basis for

We construct a uniformly bounded orthonormal almost greedy basis for L_p(0,1), 1<p<∞. The example shows that it is not possible to extend Orlicz's theorem, stating that there are no uniformly bounded orthonormal unconditional bases for L_p(0,1), p≠2, to the class of almost greedy bases.     

On the distribution of the van der Corput sequence in arbitrary base

A central limit theorem with explicit error bound, and a large deviation result are proved for a sequence of weakly dependent random variables of a special form. As a corollary, under certain conditions on the function \(f:[0,1] \rightarrow \mathbb {R}\) a central limit theorem and a large deviation result are obtained for the sum \(\sum _{n=0}^{N-1} f(x_n)\), where \(x_n\) is the base b van der Corput sequence for an arbitrary integer \(b \ge 2\). Similar results are also proved for the \(L^p\) discrepancy of the same sequence for \(1 \le p < \infty \). The main methods used in the proofs are the Berry–Esseen theorem and Fourier analysis.     

Regularities of the Distribution of β-adic van der Corput Sequences

For Pisot numbers β with irreducible β-polynomial, we prove that the discrepancy function D(N, [0,y)) of the β-adic van der Corput sequence is bounded if and only if the β-expansion of y is finite or its tail is the same as that of the expansion of 1. If β is a Parry number, then we can show that the discrepancy function is unbounded for all intervals of length y ? \Bbb Q(b) y \notin {\Bbb Q}(\beta) . We give explicit formulae for the discrepancy function in terms of lengths of iterates of a reverse β-substitution.     

Ruzsa’s problem on sets of recurrence

The main purpose of this paper is to prove the existence of Poincaré sequences of integers which are not van der Corput sets. This problem was considered in I. Ruzsa’s expository article [R₁] (1982–83) on correlative and intersective sets. Thus the existence is shown of a positive non-continuous measureμ on the circle which Fourier transform vanishes on a set of recurrence, i.e.S={n ∈Z; (n)=0} is a set of recurrence but not a van der Corput set. The method is constructive and involves some combinatorial considerations. In fact, we prove that the generic density condition for both properties are the same.     

Maximal functions along surfaces on product domains

In this paper, we study the L ^p boundedness for a class of maximal functions along surfaces in ? ⁿ × ? ^m of the form $$ \{ (\varphi _1 (|u|)u',\varphi _2 (|v|)v'):(u,v) \in \mathbb{R}^n \times \mathbb{R}^m \} . $$ We prove that such maximal functions are bounded on L ^p for all 2 ≤ p < ∞ provided that the functions ? ₁ and ? ₂ satisfy certain oscillatory estimates of van der Corput type.     

Regularities of the Distribution of β-adic van der Corput Sequences

For Pisot numbers β with irreducible β-polynomial, we prove that the discrepancy function D(N, [0,y)) of the β-adic van der Corput sequence is bounded if and only if the β-expansion of y is finite or its tail is the same as that of the expansion of 1. If β is a Parry number, then we can show that the discrepancy function is unbounded for all intervals of length . We give explicit formulae for the discrepancy function in terms of lengths of iterates of a reverse β-substitution.     

Fibonacci, Van der Corput and Riesz-Nágy

What do the three names in the title have in common? The purpose of this paper is to relate them in a new and, hopefully, interesting way. Starting with the Fibonacci numeration system — also known as Zeckendorff's system — we will pose ourselves the problem of extending it in a natural way to represent all real numbers in (0,1). We will see that this natural extension leads to what is known as the ?-system restricted to the unit interval. The resulting complete system of numeration replicates the uniqueness of the binary system which, in our opinion, is responsible for the possibility of defining the Van der Corput sequence in (0,1), a very special sequence which besides being uniformly distributed has one of the lowest discrepancy, a measure of the goodness of the uniformity.Lastly, combining the Fibonacci system and the binary in a very special way we will obtain a singular function, more specifically, the inverse of one of the family of Riesz-Nágy.     

<Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> discrepancy of generalized two-dimensional Hammersley point sets

We determine the L _p discrepancy of the two-dimensional Hammersley point set in base b. These formulas show that the L _p discrepancy of the Hammersley point set is not of best possible order with respect to the general (best possible) lower bound on L _p discrepancies due to Roth and Schmidt. To overcome this disadvantage we introduce permutations in the construction of the Hammersley point set and show that there always exist permutations such that the L _p discrepancy of the generalized Hammersley point set is of best possible order. For the L ₂ discrepancy such permutations are given explicitly. F.P. is supported by the Austrian Science Foundation (FWF), Project S9609, that is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”.     

Kernel estimates and -spectral independence of generators of -semigroups

After the appearance of W. Arendt's result that “Gaussian estimate of a semigroup implies the L^p-spectral independence of the generator,” various generalizations have been obtained. This paper shows that a certain kernel estimate of a semigroup implies the L^p-spectral independence of the generator, generalizing the case of upper Gaussian estimate and “Gaussian estimate of order α(0,1] [S. Miyajima, H. Shindoh, Gaussian estimates of order α and L^p-spectral independence of generators of C₀-semigroups, Positivity 11 (1) (2007) 15–39], Definition 3.1.” The proof uses S. Karrmann's result about the L^p-spectral independence and B.A. Barnes' theorem about the spectrum of integral operators. As an application, the L^p-spectral independence of −[(−Δ)^α+V] (α(0,1]) for a suitable V is proved with the help of a recent result by V. Liskevich, H. Vogt and J. Voigt [V. Liskevich, H. Vogt, J. Voigt, Gaussian bounds for propagators perturbed by potentials, J. Funct. Anal. 238 (2006) 245–277].     

Generalized von Neumann–Kakutani transformation and random-start scrambled Halton sequences

It is a well-known fact that the Halton sequence exhibits poor uniformity in high dimensions. Starting with Braaten and Weller in 1979, several researchers introduced permutations to scramble the digits of the van der Corput sequences that make up the Halton sequence, in order to improve the uniformity of the Halton sequence. These sequences are called scrambled Halton, or generalized Halton sequences. Another significant result on the Halton sequence was the fact that it could be represented as the orbit of the von Neumann–Kakutani transformation, as observed by Lambert in 1982. In this paper, I will show that a scrambled Halton sequence can be represented as the orbit of an appropriately generalized von Neumann–Kakutani transformation. A practical implication of this result is that it gives a new family of randomized quasi-Monte Carlo sequences: random-start scrambled Halton sequences. This work generalizes random-start Halton sequences of Wang and Hickernell. Numerical results show that random-start scrambled Halton sequences can improve on the sample variance of random-start Halton sequences by factors as high as 7000.     

Van der Corput Sequences and Linear Permutations

This extended abstract is concerned with the irregularities of distribution of one-dimensional permuted van der Corput sequences that are generated from linear permutations. We show how to obtain upper bounds for the discrepancy and diaphony of these sequences, by relating them to Kronecker sequences and applying earlier results of Faure and Niederreiter.     

nth order Stieltjes differential boundary operators and Stieltjes differential boundary systems

This article discusses linear differential boundary systems, which include nth-order differential boundary relations as a special case, in $\text{L}$_n^p[0,1] × $\text{L}$_n^p[0,1], 1 ? p < ∞. The adjoint relation in $\text{L}$_n^q[0,1] × $\text{L}$_n^q[0,1], $\text{1}\text{p}\text{+}\text{1}\text{q}\text{= 1}$, is derived. Green's formula is also found. Self-adjoint relations are found in $\text{L}$_n²[0,1] × $\text{L}$_n²[0,1], and their connection with Coddington's extensions of symmetric operators on subspaces of $\text{L}$_n^p[0,1] × $\text{L}$_n²[0,1] is established.     

Kolmogorov numbers of Riemann–Liouville operators over small sets and applications to Gaussian processes

We investigate compactness properties of the Riemann–Liouville operator R_α of fractional integration when regarded as operator from L₂[0,1] into C(K), the space of continuous functions over a compact subset K in [0,1]. Of special interest are small sets K, i.e. those possessing Lebesgue measure zero (e.g. fractal sets). We prove upper estimates for the Kolmogorov numbers of R_α against certain entropy numbers of K. Under some regularity assumption about the entropy of K these estimates turn out to be two-sided. By standard methods the results are also valid for the (dyadic) entropy numbers of R_α. Finally, we apply these estimates for the investigation of the small ball behavior of certain Gaussian stochastic processes, as e.g. fractional Brownian motion or Riemann–Liouville processes, indexed by small (fractal) sets.     

Approximation of sine-shaped functions by constants in the spaces <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>, <Emphasis Type="Italic">p</Emphasis> < 1

We investigate the best approximations of sine-shaped functions by constants in the spaces L_p for p < 1. In particular, we find the best approximation of perfect Euler splines by constants in the spaces L_p for certain p(0,1).Translated from Ukrainskyi Matematychnyi Zhurnal, Vol. 56, No. 6, pp. 745–762, June, 2004.     

Convex-transitivity and function spaces

It is shown that if X is a convex-transitive Banach space and 1p<∞, then L^p([0,1],X) and are convex-transitive. Here is the closed linear span of the simple functions in the Bochner space L^∞([0,1],X). If H is an infinite-dimensional Hilbert space and C₀(L) is convex-transitive, then C₀(L,H) is convex-transitive. Some new fairly concrete examples of convex-transitive spaces are provided.     

Jung's relative constant of the space Lp

We prove that in real spaces L_p[0,1], 1p <, and _p Jung's relative constant is equal to 2^–1/r, wherer=max {p,p (p–1)^–1}. We obtain upper bounds for this quantity in finite-dimensional spaces _p ⁿ which are exact in some dimensions whenp2.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 1, pp. 122–125, January, 1990.     

The convergence of the best discrete linear Lp approximation as p → 1

It is well known that the best discrete linear L_p approximation converges to a special best Chebyshev approximation as p → ∞. In this paper it is shown that the corresponding result for the case p → 1 is also true. Furthermore, the special best L₁ approximation obtained as the limit is characterized as the unique solution of a nonlinear programming problem on the set of all L₁ solutions.