2000 character limit reached
Tractability properties of the discrepancy in Orlicz norms
Published 28 Oct 2019 in math.NA, cs.NA, and math.NT | (1910.12571v2)
Abstract: We show that the minimal discrepancy of a point set in the $d$-dimensional unit cube with respect to Orlicz norms can exhibit both polynomial and weak tractability. In particular, we show that the $\psi_\alpha$-norms of exponential Orlicz spaces are polynomially tractable.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.