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

📅 2026-07-16
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the construction of high-dimensional low-discrepancy sequences to achieve optimal numerical integration accuracy, with a focus on ensuring uniformity—specifically, t=0 property—in all critical subspace projections. Building upon the Sobol’ recursive framework, the study establishes, for the first time, sufficient conditions under which Artin–Schreier irreducible polynomials yield t=0 sequences. By integrating these polynomials with b-dimensional linear polynomial sequences and employing a fast greedy optimization strategy, the authors construct quasi-Monte Carlo sequences of dimension 2b−1 when the base b is prime. These sequences attain t=0 in all relevant subspaces, thereby achieving perfect (b−1)-dimensional uniformity and significantly improving the worst-case error bound for high-dimensional integration.
📝 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 $t$ value, where $t=0$ yields the best uniformity. Producing sequences of samples with bounded $t$ values can be achieved with Sobol' recursive construction, that uses coefficients of irreducible polynomials. While $b$-dimensional sequences with $t=0$ can be obtained by taking $b$ polynomials of degree $1$ over the Galois Field $\mathrm{GF}(b)$, we show conditions that guarantee $t=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=0$ in this case. We then focus on Artin-Schreier irreducible polynomials, in the form $p_i(x) = x^b - x + c_i$, where $i \in \{1, \dots, b-1\}$ and $b$ is prime, and we make explicit conditions that always guarantees $t=0$ in $b-1$ dimensions. Combining $b$-dimensional Sobol' of degree $1$ and our $(b-1)$-dimensional Artin-Schreier sequence of degree $b$, we provide a fast greedy procedure that optimizes the $(2b-1)$-dimensional combined $t$ value, while guaranteeing $t=0$ projection in subspaces.
Problem

Research questions and friction points this paper is trying to address.

Quasi-Monte Carlo
uniformity
t-value
Artin-Schreier polynomials
Sobol' sequences
Innovation

Methods, ideas, or system contributions that make the work stand out.

Quasi-Monte Carlo
Artin-Schreier polynomials
low-discrepancy sequences
Sobol' sequences
uniform distribution
🔎 Similar Papers