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

DOI10.7169/FACM/1317045237zbMATH Open1247.11097OpenAlexW2061794678MaRDI QIDQ644313FDOQ644313

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

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\)

zbMATH Keywords

digital netsstar discrepancypolynomial lattices

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Low discrepancy polynomial lattice point sets
• Title not available (Why is that?)
• 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)