A lower bound on a quantity related to the quality of polynomial lattices

DOI10.7169/FACM/1317045237MaRDI QIDQ644313zbMATH OpenOpenAlexFDO

Authors Peter Kritzer, Friedrich Pillichshammer

Publication date 3 November 2011

Published in Functiones et Approximatio. Commentarii Mathematici (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/euclid.facm/1317045237

zbMATH Keywords

digital netsstar discrepancypolynomial lattices

Mathematics Subject Classification ID

Irregularities of distribution, discrepancy (11K38) General theory of distribution modulo (1) (11K06)

Recommendations

• Low discrepancy polynomial lattice point sets
• Discrepancy of higher rank polynomial lattice point sets
• On the existence of higher order polynomial lattices based on a generalized figure of merit
• Polynomial lattice point sets
• Bounds for the quality parameter of digital shift nets over \(\mathbb Z_2\)

Cites work

• scientific article; zbMATH DE number 5797591 (Why is no real title available?)
• scientific article; zbMATH DE number 4062985 (Why is no real title available?)
• scientific article; zbMATH DE number 53679 (Why is no real title available?)
• scientific article; zbMATH DE number 1246221 (Why is no real title available?)
• scientific article; zbMATH DE number 2051209 (Why is no real title available?)
• scientific article; zbMATH DE number 3440485 (Why is no real title available?)
• scientific article; zbMATH DE number 914714 (Why is no real title available?)
• A best lower bound for good lattice points
• Construction Algorithms for Digital Nets with Low Weighted Star Discrepancy
• Construction algorithms for polynomial lattice rules for multivariate integration
• Constructions of general polynomial lattice rules based on the weighted star discrepancy
• Low-discrepancy point sets obtained by digital constructions over finite fields
• Multivariate integration in weighted Hilbert spaces based on Walsh functions and weighted Sobolev spaces
• On the distribution of sequences connected with good lattice points
• Optimal Polynomials for (T,M,S)-Nets and Numerical Integration of Multivariate Walsh Series
• Point sets and sequences with small discrepancy
• Randomized Polynomial Lattice Rules for Multivariate Integration and Simulation
• Relevancy-based use of lemmas in connection tableau calculi (Diss., TU München, 1999)
• Sequences, discrepancies and applications

Cited in

(3)

• scientific article; zbMATH DE number 5941303 (Why is no real title available?)
• Low discrepancy polynomial lattice point sets
• Discrepancy theory and quasi-Monte Carlo integration

This page was built for publication: A lower bound on a quantity related to the quality of polynomial lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644313)