Combinatorial methods in the construction of point sets with uniformity properties
DOI10.1016/0895-7177(96)00035-0zbMATH Open0854.11039OpenAlexW2087568611MaRDI QIDQ1921093FDOQ1921093
Authors: Gary L. Mullen
Publication date: 19 January 1997
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(96)00035-0
Recommendations
Monte Carlo methods (65C05) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38) Orthogonal arrays, Latin squares, Room squares (05B15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Low-discrepancy and low-dispersion sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures
- Point sets and sequences with small discrepancy
- A combinatorial problem for vector spaces over finite fields
- Finite nets. II: Uniqueness and imbedding
- Title not available (Why is that?)
- Point sets with uniformity properties and orthogonal hypercubes
- Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
- Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
- An updated table of minimum-distance bounds for binary linear codes
- Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rook domains, Latin squares, affine planes, and error-distributing codes
- Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
Cited In (5)
This page was built for publication: Combinatorial methods in the construction of point sets with uniformity properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921093)