Point sets with uniformity properties and orthogonal hypercubes

DOI10.1007/BF01301071MaRDI QIDQ1207670zbMATH OpenFDO

Authors Gary L. Mullen, Geoff Whittle

Publication date 12 May 1993

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

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

zbMATH Keywords

netsorthogonal hypercubespoint setsrandom number generationsmall discrepancy

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Irregularities of distribution, discrepancy (11K38) Pseudo-random numbers; Monte Carlo methods (11K45) Finite partial geometries (general), nets, partial spreads (51E14) Random number generation in numerical analysis (65C10)

Review text

The theory of \((t,m,s)\)-nets is useful in the study of sets of points in the unit cube with small discrepancy. It is known that the existence of a \((0,2,s)\)-net in base \(b\) is equivalent to the existence of \(s-2\) mutually orthogonal latin squares of order \(b\). In this paper this equivalence is generalized by showing that for \(t\geq 0\) the existence of a \((t,t+2,s)\)-net in base \(b\) is equivalent to the existence of \(s\) mutually orthogonal hypercubes of dimension \(t+2\) and order \(b\). Using the theory of hypercubes, upper bounds on \(s\) for the existence of such nets are obtained. For \(b\) a prime power these bounds are best possible. Several open problems are also stated.

Recommendations

• An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Digital almost nets
• Point sets and sequences with small discrepancy
• scientific article; zbMATH DE number 1229678

Cites work

• A combinatorial problem for vector spaces over finite fields
• A Statistical Analysis of Generalized Feedback Shift Register Pseudorandom Number Generators
• Generalizations of Bose's equivalence between complete sets of mutually orthogonal Latin squares and affine planes
• scientific article; zbMATH DE number 4090661 (Why is no real title available?)
• scientific article; zbMATH DE number 3443668 (Why is no real title available?)
• Point sets and sequences with small discrepancy
• Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order

Cited in

(17)

• Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes
• Orthogonal hypercubes and related designs
• Factorization of polynomials and some linear-algebra problems over finite fields
• \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures
• A candidate for the ``Next Fermat Problem
• Digital nets and sequences constructed over finite rings and their application to quasi-Monte Carlo integration
• Combinatorial methods in the construction of point sets with uniformity properties
• An equivalence between (T,M,S)-nets and strongly orthogonal hypercubes
• On sets of orthogonal d-cubes
• Good Parameters for a Class of Node Sets in Quasi-Monte Carlo Integration
• scientific article; zbMATH DE number 16647 (Why is no real title available?)
• scientific article; zbMATH DE number 1341370 (Why is no real title available?)
• Sudoku-like arrays, codes and orthogonality
• Classification of Graeco-Latin Cubes
• Sets of orthogonal hypercubes of class \(r\)
• (s,r; )-nets and alternating forms graphs
• Finite field constructions of combinatorial arrays

This page was built for publication: Point sets with uniformity properties and orthogonal hypercubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207670)