Vandermonde nets

Volume 163 / 2014

Roswitha Hofer, Harald Niederreiter Acta Arithmetica 163 (2014), 145-160 MSC: Primary 11K31; Secondary 11K38. DOI: 10.4064/aa163-2-5


The second-named author recently suggested identifying the generating matrices of a digital $(t,m,s)$-net over the finite field ${\mathbb F}_q$ with an $s \times m$ matrix $C$ over ${\mathbb F}_{q^m}$. More exactly, the entries of $C$ are determined by interpreting the rows of the generating matrices as elements of ${\mathbb F}_{q^m}$. This paper introduces so-called Vandermonde nets, which correspond to Vandermonde-type matrices $C$, and discusses the quality parameter and the discrepancy of such nets. The methods that have been successfully used for the investigation of polynomial lattice point sets and hyperplane nets are applied to this new class of digital nets. In this way, existence results for small quality parameters and good discrepancy bounds are obtained. Furthermore, a first step towards component-by-component constructions is made. A novelty of this new class of nets is that explicit constructions of Vandermonde nets over ${\mathbb F}_q$ in dimensions $s\leq q+1$ with best possible quality parameter can be given. So far, good explicit constructions of the competing polynomial lattice point sets are known only in dimensions $s\leq 2$.


  • Roswitha HoferInstitute of Financial Mathematics
    Johannes Kepler University Linz
    Altenbergerstr. 69
    A-4040 Linz, Austria
  • Harald NiederreiterJohann Radon Institute for
    Computational and Applied Mathematics
    Austrian Academy of Sciences
    Altenbergerstr. 69
    A-4040 Linz, Austria
    Department of Mathematics
    University of Salzburg
    Hellbrunnerstr. 34
    A-5020 Salzburg, Austria

Search for IMPAN publications

Query phrase too short. Type at least 4 characters.

Rewrite code from the image

Reload image

Reload image