Abstract
In this paper we study two problems concerning the arrangement of a given finite point set in the unit cube. We give a satisfying solution for both of these problems in dimension one and show their intimate relation.
Similar content being viewed by others
References
Béjian R., Faure H.: Discrépance de la suite de van der Corput. C. R. Acad. Sci. Paris Sér. A 285, 313–316 (1977)
Larcher G.: Quantitative rearrangement theorems. Compos. Math. 60, 251–259 (1986)
Niederreiter, H.: Rearrangement theorems for sequences. Astérisque 24–25, Soc. Math. France 243–261 (1975)
Niederreiter H.: A general rearrangement theorem for sequences. Arch. Math. 43, 530–534 (1984)
Niederreiter H.: Point sets and sequences with small discrepancy. Monatsh. Math. 104, 273–337 (1987)
Niederreiter, H.: Random number generation and Quasi-Monte Carlo methods. CBMS-NSF Series in Applied Mathematics, vol 63.SIAM, Philadelphia (1992)
Steinerberger, S.: Random restricted matching and lower bounds for combinatorial optimization. J. Comb. Optim. (2012). doi:10.1007/s10878-011-9384-4
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Kritzer, P., Larcher, G. On the arrangement of point sets in the unit interval. manuscripta math. 140, 377–391 (2013). https://doi.org/10.1007/s00229-012-0547-0
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00229-012-0547-0