Low discrepancy polynomial lattice point sets
For a prime \(q\) let \(\mathbb{F}_q\) be the finite field consisting of \(q\) elements, let \(\mathbb{F}_q[x]\) be the ring of polynomials over \(\mathbb{F}_q\), and let \(\mathbb{F}_q((x^{-1}))\) be the field of formal Laurent series over \(\mathbb{F}_q\). Given an integer \(m\geq 1\), define a map \(\phi _m:\mathbb{F}_q((x^{-1}))\to [0,1)\) by NEWLINE\[NEWLINE\phi_m\left(\sum_{l=z}^{\infty}t_lx^{-l}\right):=\sum_{l=\max(1,z)}^m t_lq^{-l}.NEWLINE\]NEWLINE For \(0\leq n<q^m\) let \(n=n_0+n_1q+\cdots +n_{m-1}q^{m-1}\), where \(n_i\in \mathbb{Z}_q\), be the \(q\)-adic expansion of \(n\) and let \(n(x)=\sum_{r=0}^{m-1}n_rx^r\). For \(f\in\mathbb{F}_q[x]\) with \(\deg(f)=m\) and \(g_1,\ldots, g_s\in\mathbb{F}_q[x]\) let NEWLINE\[NEWLINE\mathbf{x}_n:=\left(\phi_m\left(\frac{n(x)g_1(x)}{f(x)}\right),\ldots, \phi_m\left(\frac{n(x)g_s(x)}{f(x)}\right)\right) \text{ for } 0\leq n<q^m.NEWLINE\]NEWLINE The polynomial lattice point set \(\mathcal{P}(\mathbf{g},f)=\{\mathbf{x}_n:0\leq n<q^m\}\) is defined.NEWLINENEWLINE\textit{G. Larcher} [Acta Arith. 63, No. 1, 1--13 (1993, Zbl 0770.11040)] showed that there exists a \(c(s,q)>0\) with the property that for every \(m\in \mathbb{N}\) there exists a vector \(\mathbf{g}\in \mathbb{F}_q[x]^s\) such that NEWLINE\[NEWLINED_N^*(\mathcal{P} (\mathbf{g}, x^m))\leq c(s,q)\frac{(\log N)^{s-1}\log\log N}{N},NEWLINE\]NEWLINE where \(N=q^m\).NEWLINENEWLINEIn this paper the authors show that there exists a \(c(s,q)>0\) with the property that for any monic polynomial \(f\in\mathbb{F}_q[x]\) of degree \(m\) with \(\gcd(f,x)=1\) there exists a generating vector \(\mathbf{g}=(g_1, \ldots, g_s)\in \mathbb{F}_q[x]^s\) of monic polynomials where \(g_1=1\) and \(\deg(g_i)<m\) for \(2\leq i\leq s\), such that NEWLINE\[NEWLINED_N^*(\mathcal{P}(\mathbf{g},f))\leq c(s,q)\frac{(\log N)^{s-1}\log\log N}{N},NEWLINE\]NEWLINE where \(N=q^m\).
- A lower bound on a quantity related to the quality of polynomial lattices
- scientific article; zbMATH DE number 5797591 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- Irregularities of distribution, VII
- Low-discrepancy point sets obtained by digital constructions over finite fields
- Minoration de la discrépance d'une suite quelconque sur T
- Nets obtained from rational functions over finite fields
- On irregularities of distribution
- On the small ball inequality in all dimensions
- Rational functions with partial quotients of small degree in their continued fraction expansion
- Constructing good higher order polynomial lattice rules with modulus of reduced degree
- A note on isotropic discrepancy and spectral test of lattice point sets
- Proof techniques in quasi-Monte Carlo theory
- Metrical lower bounds on the discrepancy of digital Kronecker-sequences
- Discrepancy of higher rank polynomial lattice point sets
- An algorithm for QMC integration using low-discrepancy lattice sets
- Construction of scrambled polynomial lattice rules over \(\mathbb{F}_{2}\) with small mean square weighted \(\mathcal{L}_{2}\) discrepancy
- Low-discrepancy point sets obtained by digital constructions over finite fields
- scientific article; zbMATH DE number 553892 (Why is no real title available?)
- On Hybrid Point Sets Stemming from Halton-Type Hammersley Point Sets and Polynomial Lattice Point Sets
- Discrepancy theory and quasi-Monte Carlo integration
- Polynomial lattice point sets
- A lower bound on a quantity related to the quality of polynomial lattices
- On an example of finite hybrid quasi-Monte Carlo point sets
This page was built for publication: Low discrepancy polynomial lattice point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452386)
