English

Perfectly equidistributed Quasi-Monte Carlo sequences from Artin-Schreier polynomials

Discrete Mathematics 2026-07-16 v1 Numerical Analysis

Abstract

To numerically integrate a function, one may resort to Quasi-Monte Carlo estimators, that average integrand values at pseudo-random well-distributed uniform sampling locations. Better uniformity improves the worst-case integration-error bound. A standard measure of uniformity is given by an integer tt value, where t=0t=0 yields the best uniformity. Producing sequences of samples with bounded tt values can be achieved with Sobol' recursive construction, that uses coefficients of irreducible polynomials. While bb-dimensional sequences with t=0t=0 can be obtained by taking bb polynomials of degree 11 over the Galois Field GF(b)\mathrm{GF}(b), we show conditions that guarantee t=0t=0 for specific higher degree polynomials. In particular, we relate the Sobol' construction to tensorized powers of Pascal matrices when the chosen polynomials only differ by a constant and exhibit simple conditions to guarantee t=0t=0 in this case. We then focus on Artin-Schreier irreducible polynomials, in the form pi(x)=xbx+cip_i(x) = x^b - x + c_i, where i{1,,b1}i \in \{1, \dots, b-1\} and bb is prime, and we make explicit conditions that always guarantees t=0t=0 in b1b-1 dimensions. Combining bb-dimensional Sobol' of degree 11 and our (b1)(b-1)-dimensional Artin-Schreier sequence of degree bb, we provide a fast greedy procedure that optimizes the (2b1)(2b-1)-dimensional combined tt value, while guaranteeing t=0t=0 projection in subspaces.

Keywords

Cite

@article{arxiv.2607.15141,
  title  = {Perfectly equidistributed Quasi-Monte Carlo sequences from Artin-Schreier polynomials},
  author = {Nicolas Bonneel and David Coeurjolly and Victor Ostromoukhov},
  journal= {arXiv preprint arXiv:2607.15141},
  year   = {2026}
}