2011
DOI: 10.1007/s10231-011-0208-z
|View full text |Cite
|
Sign up to set email alerts
|

Discrepancy of LS-sequences of partitions and points

Abstract: In this paper we give a precise estimate of the discrepancy of a class of uniformly distributed sequences of partitions. Among them we found a large class having low discrepancy (which means of order 1 N ). One of them is the Kakutani-Fibonacci sequence.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
56
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 27 publications
(56 citation statements)
references
References 6 publications
0
56
0
Order By: Relevance
“…If k = 2, then we obtain the definition of the classical LS-sequence of partitions introduced by C a r b o n e [4]. Given a sequence of partitions we can assign a sequence of points by ordering the left endpoints of the intervals in the partition.…”
Section: ò ø óò 3 (Generalized Ls-sequence Of Partitions)º Letmentioning
confidence: 99%
See 4 more Smart Citations
“…If k = 2, then we obtain the definition of the classical LS-sequence of partitions introduced by C a r b o n e [4]. Given a sequence of partitions we can assign a sequence of points by ordering the left endpoints of the intervals in the partition.…”
Section: ò ø óò 3 (Generalized Ls-sequence Of Partitions)º Letmentioning
confidence: 99%
“…One issue of this paper is to find an ordering that yields good upper bounds for the discrepancy of the sequence. In the case that k = 2 the corresponding LS-sequences of points, denoted by (ξ n L,S ) n∈N , have been introduced by C a r b o n e [4] who proved that whenever L ≥ S there exists a positive constant k 1 such that…”
Section: ò ø óò 3 (Generalized Ls-sequence Of Partitions)º Letmentioning
confidence: 99%
See 3 more Smart Citations