Combinatorial methods in the construction of point sets with uniformity properties

DOI10.1016/0895-7177(96)00035-0zbMath0854.11039OpenAlexW2087568611MaRDI QIDQ1921093

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

zbMATH Keywords

Latin squareshypercubes\((t, m, s)\)-nets

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Orthogonal arrays, Latin squares, Room squares (05B15) Numerical integration (65D30) Irregularities of distribution, discrepancy (11K38)

Related Items (3)

Unnamed Item ⋮ Generalizing Sudoku to three dimensions ⋮ Orthogonal hypercubes and related designs

Cites Work

• Point sets and sequences with small discrepancy
• Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
• Low-discrepancy and low-dispersion sequences
• A combinatorial problem for vector spaces over finite fields
• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Point sets with uniformity properties and orthogonal hypercubes
• \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures
• Finite nets. II: Uniqueness and imbedding
• Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
• An updated table of minimum-distance bounds for binary linear codes
• Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
• Rook domains, Latin squares, affine planes, and error-distributing codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Combinatorial methods in the construction of point sets with uniformity properties