2012
DOI: 10.1016/j.jco.2011.07.001
|View full text |Cite
|
Sign up to set email alerts
|

Fibonacci sets and symmetrization in discrepancy theory

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
24
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(24 citation statements)
references
References 20 publications
0
24
0
Order By: Relevance
“…, σ n ) ⊤ is an element of Z n 2 . We obtain a digit shifted digital net by altering the fourth step in the construction scheme of digital nets to C 2 r + σ =: (y (2) r,1 , . .…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…, σ n ) ⊤ is an element of Z n 2 . We obtain a digit shifted digital net by altering the fourth step in the construction scheme of digital nets to C 2 r + σ =: (y (2) r,1 , . .…”
Section: Introduction and Main Resultsmentioning
confidence: 99%
“…We apply the notation of [8] in this paper and use several results and ideas from there. The third paper which inspired this work is by Bilyk, Temlyakov and Yu [2], who computed the Fourier coefficients of the discrepancy function of the symmetrized Fibonacci lattice exactly in order to find an exact formula for its L 2 discrepancy. We do the same for a class of digital (0, n, 2)-net with the difference that we compute the Haar coefficients instead of the Fourier coefficients, since Haar functions fit the structure of digital nets much better than harmonic functions.…”
Section: Remarkmentioning
confidence: 99%
“…Note that Φn(f) represents a special Korobov type integration formula. The idea to use Fibonacci numbers goes back to and was later used by Temlyakov to study integration in spaces with mixed smoothness (see also the recent contribution ). We will first focus on periodic functions and extend the results later to the non‐periodic situation.…”
Section: Integration On the Fibonacci Latticementioning
confidence: 99%
“…By using simple embedding properties, our results below directly imply Temlyakov's earlier results [, Thm. IV.2.1], [, Thm. 1.1] on Sobolev spaces Wpr(T2).…”
Section: Integration On the Fibonacci Latticementioning
confidence: 99%
“…for some positive constant C(α) depending only on α. The purpose of this paper is to find the precise order of magnitude of the left hand side of (4), where A is as in (3). We will work with a weaker assumption than α being badly approximable, however: we will assume that the continued fraction representation α = [a 0 ; a 1 , a 2 , .…”
mentioning
confidence: 99%