Beschreibung:
<jats:p>We study a construction algorithm for certain polynomial lattice rules modulo arbitrary polynomials. The underlying polynomial lattices are special types of digital nets as introduced by Niederreiter. Dick, Kuo, Pillichshammer and Sloan recently introduced construction algorithms for polynomial lattice rules modulo irreducible polynomials which yield a small worst-case error for integration of functions in certain weighted Hilbert spaces. Here, we generalize these results to the case where the polynomial lattice rules are constructed modulo<jats:italic>arbitrary</jats:italic>polynomials.</jats:p>