Point sets and sequences with small discrepancy

DOI10.1007/BF01294651zbMath0626.10045OpenAlexW2009231757MaRDI QIDQ580423

Publication date: 1987

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/178356

zbMATH Keywords

Latin squares finite fields pseudorandom number generation open problems point sets finite projective planes \((t,m,s)\)- nets \(s\)-dimensional unit cube algebraic coding theory digital multistep method discrepancy of \((t,s)\)-sequences discrepancy of nets GFSR method

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Finite fields and commutative rings (number-theoretic aspects) (11T99) Combinatorial aspects of finite geometries (05B25) General theory of distribution modulo (1) (11K06)

Related Items (only showing first 100 items - show all)

Characterization of extended Hamming and Golay codes as perfect codes in poset block spaces ⋮ Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences ⋮ On the root mean square weighted \(L_{2}\) discrepancy of scrambled nets ⋮ Optimal quasi-Monte Carlo rules on order 2 digital nets for the numerical integration of multivariate periodic functions ⋮ Sequential Monto Carlo techniques for the solution of linear systems ⋮ \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures ⋮ Construction algorithms for good extensible lattice rules ⋮ Spline methods using integration lattices and digital nets ⋮ Variations on \((0,s)\)-sequences ⋮ Quasi-random simulation of linear kinetic equations ⋮ Calculation of the quality parameter of digital nets and application to their construction ⋮ An algorithm to compute bounds for the star discrepancy ⋮ On the numerical integration of high-dimensional Walsh-series by quasi-Monte Carlo methods ⋮ MacWilliams-type identities for fragment and sphere enumerators ⋮ Weight distribution of the crown-weight space ⋮ On the mean square weighted \(\mathcal {L}_2\) discrepancy of randomized digital nets in prime base ⋮ Low-discrepancy and low-dispersion sequences ⋮ Low-discrepancy sampling for approximate dynamic programming with local approximators ⋮ The tent transformation can improve the convergence rate of quasi-Monte Carlo algorithms using digital nets ⋮ A search for extensible low-WAFOM point sets ⋮ Codes with a poset metric ⋮ Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration ⋮ BMO and exponential Orlicz space estimates of the discrepancy function in arbitrary dimension ⋮ Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces ⋮ Physics-informed distribution transformers via molecular dynamics and deep neural networks ⋮ Low discrepancy sequences for solving the Boltzmann equation ⋮ Quasi-Monte Carlo methods for numerical integration of multivariate Haar series ⋮ Particle simulations of the Kac model of the Boltzmann equation ⋮ New star discrepancy bounds for \((t,m,s)\)-nets and \((t,s)\)-sequences ⋮ Combinatorial methods in the construction of point sets with uniformity properties ⋮ Quasi-Monte-Carlo methods and the dispersion of point sequences ⋮ Volume-discrepancy estimates in one and two dimensions ⋮ Quasi-Monte Carlo methods for the numerical integration of multivariate Walsh series ⋮ Optimal \(L_{p}\)-discrepancy bounds for second order digital sequences ⋮ The covering problem in Rosenbloom-Tsfasman spaces ⋮ A particle method for some parabolic equations ⋮ A construction of digital \((0,s)\)-sequences involving finite-row generator matrices ⋮ From van der Corput to modern constructions of sequences for quasi-Monte Carlo rules ⋮ Error bounds for the integration of singular functions using equidistributed sequences ⋮ Duality theory and propagation rules for higher order nets ⋮ On the arrangement of point sets in the unit interval ⋮ Kronecker-Halton sequences in \(\mathbb{F}_p((X^{-1}))\) ⋮ A survey of some applications of finite fields ⋮ Finite field constructions of combinatorial arrays ⋮ Extensible hyperplane nets ⋮ The triple distribution of codes and ordered codes ⋮ A lower bound on a quantity related to the quality of polynomial lattices ⋮ A construction of polynomial lattice rules with small gain coefficients ⋮ Statistical independence properties of pseudorandom vectors produced by matrix generators ⋮ Quasi-Monte Carlo simulation of diffusion ⋮ Using permutations to reduce discrepancy ⋮ A characterization of strong orthogonal arrays of strength three ⋮ On the discrepancy of \((0,1)\)-sequences. ⋮ Discrepancy estimates for index-transformed uniformly distributed sequences ⋮ On a simple quasi-Monte Carlo approach for classical ultimate ruin probabilities ⋮ On the \(L_p\) discrepancy of two-dimensional folded Hammersley point sets ⋮ Recent trends in random number and random vector generation ⋮ Tractability using periodized generalized Faure sequences ⋮ Dyadic diaphony of digital sequences ⋮ A new measure of irregularity of distribution ⋮ Ruin theory with risk proportional to the free reserve and securitization ⋮ Wei-type duality theorems for matroids ⋮ A combinatorial problem for vector spaces over finite fields ⋮ On the connectedness of limit net sets ⋮ The Halton sequence and its discrepancy in the Cantor expansion ⋮ Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes ⋮ On the exact \(t\)-value of Niederreiter and Sobol' sequences ⋮ Quasi-Monte Carlo simulation of coagulation-fragmentation ⋮ A higher order Blokh-Zyablov propagation rule for higher order nets ⋮ Quasi-Monte Carlo methods with applications in finance ⋮ Point sets with uniformity properties and orthogonal hypercubes ⋮ New explicit bounds for ordered codes and \((t,m,s)\)-nets ⋮ Optimal Latin hypercube designs for the Kullback-Leibler criterion ⋮ Cubic and higher degree bounds for codes and \((t,m,s)\)-nets ⋮ On the \(L_2\)-discrepancy of the Sobol-Hammersley net in dimension 3 ⋮ Construction algorithms for higher order polynomial lattice rules ⋮ MinT-architecture and applications of the \((t, m, s)\)-net and OOA database ⋮ Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces ⋮ Weighted integration over a hyperrectangle based on digital nets and sequences ⋮ A critical appraisal of design of experiments for uncertainty quantification ⋮ On the distribution properties of Niederreiter-Halton sequences ⋮ Duality for digital sequences ⋮ Constructions and bounds on linear error-block codes ⋮ Maximum distance separable poset codes ⋮ A simple derivation of the MacWilliams identity for linear ordered codes and orthogonal arrays ⋮ Optimal characteristic polynomials for digital multistep pseudorandom numbers ⋮ Scrambling Sobol' and Niederreiter-Xing points ⋮ What Monte Carlo models can do and cannot do efficiently? ⋮ Commutative association schemes ⋮ Bounds on the discrepancy of linear recurring sequences over Galois rings ⋮ Applications of randomized low discrepancy sequences to the valuation of complex securities ⋮ On the approximation of smooth functions using generalized digital nets ⋮ On designs in compact metric spaces and a universal bound on their size ⋮ Orthogonal hypercubes and related designs ⋮ Reliability analysis of discrete-state performance functions via adaptive sequential sampling with detection of failure surfaces ⋮ Factorization of polynomials and some linear-algebra problems over finite fields ⋮ A study of orthogonal array-based designs under a broad class of space-filling criteria ⋮ Multidimensional quasi-Monte Carlo methods ⋮ Bounds for the quality parameter of digital shift nets over \(\mathbb Z_2\) ⋮ Adaptive random search in quasi-Monte Carlo methods for global optimization

Cites Work

This page was built for publication: Point sets and sequences with small discrepancy