Combinatorial methods in the construction of point sets with uniformity properties

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

It is well known that (t, m, s)-nets are useful in numerical analysis. Many of the constructions of such nets arise from number theoretic or algebraic constructions. Less well known is the fact that combinatorial constructions also yield nets with very good and in many cases, optimal parameters. In this paper, we provide a survey of such combinatorial constructions of (t, m, s)-nets.

Original languageEnglish (US)
Pages (from-to)1-8
Number of pages8
JournalMathematical and Computer Modelling
Volume23
Issue number8-9
DOIs
StatePublished - Jan 1 1996

Fingerprint

Uniformity
Set of points
(t, m, s)-nets
Optimal Parameter
Numerical analysis
Numerical Analysis

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Computer Science Applications

Cite this

@article{ba8246d5d5b441de9fb5b5b27ff0549c,
title = "Combinatorial methods in the construction of point sets with uniformity properties",
abstract = "It is well known that (t, m, s)-nets are useful in numerical analysis. Many of the constructions of such nets arise from number theoretic or algebraic constructions. Less well known is the fact that combinatorial constructions also yield nets with very good and in many cases, optimal parameters. In this paper, we provide a survey of such combinatorial constructions of (t, m, s)-nets.",
author = "Mullen, {Gary Lee}",
year = "1996",
month = "1",
day = "1",
doi = "10.1016/0895-7177(96)00035-0",
language = "English (US)",
volume = "23",
pages = "1--8",
journal = "Mathematical and Computer Modelling",
issn = "0895-7177",
publisher = "Elsevier Limited",
number = "8-9",

}

Combinatorial methods in the construction of point sets with uniformity properties. / Mullen, Gary Lee.

In: Mathematical and Computer Modelling, Vol. 23, No. 8-9, 01.01.1996, p. 1-8.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Combinatorial methods in the construction of point sets with uniformity properties

AU - Mullen, Gary Lee

PY - 1996/1/1

Y1 - 1996/1/1

N2 - It is well known that (t, m, s)-nets are useful in numerical analysis. Many of the constructions of such nets arise from number theoretic or algebraic constructions. Less well known is the fact that combinatorial constructions also yield nets with very good and in many cases, optimal parameters. In this paper, we provide a survey of such combinatorial constructions of (t, m, s)-nets.

AB - It is well known that (t, m, s)-nets are useful in numerical analysis. Many of the constructions of such nets arise from number theoretic or algebraic constructions. Less well known is the fact that combinatorial constructions also yield nets with very good and in many cases, optimal parameters. In this paper, we provide a survey of such combinatorial constructions of (t, m, s)-nets.

UR - http://www.scopus.com/inward/record.url?scp=0039860064&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0039860064&partnerID=8YFLogxK

U2 - 10.1016/0895-7177(96)00035-0

DO - 10.1016/0895-7177(96)00035-0

M3 - Article

AN - SCOPUS:0039860064

VL - 23

SP - 1

EP - 8

JO - Mathematical and Computer Modelling

JF - Mathematical and Computer Modelling

SN - 0895-7177

IS - 8-9

ER -