Optimal bounds for design curves on the torus
math.NA, cs.NA
Submitted: 2026-11-02
Updated: 2026-11-02
License: http://creativecommons.org/licenses/by/4.0/
The gist: A closed rectifiable curve on the torus T d= R d/ Z d is a t-design curve if normalized arclength integration is exact for trigonometric polynomials e 2πi m,x with frequencies m in Z d satisfying m…
Abstract
A closed rectifiable curve on the torus T d= R d/ Z d is a t-design curve if normalized arclength integration is exact for trigonometric polynomials e 2πi m,x with frequencies m in Z d satisfying |m| infinity at most t. For the arclength L of such curves, we establish the sharp lower bound L at least ((t+1) 2d-1 over t(t+2)) 1/2. Equality is attained by the family of Korobov curves described in. For even t, we also derive an explicit lower bound on the length of total-degree t-design curves, defined by the frequency condition |m| 1 at most t. This bound is sharp for t=2 in every dimension and for every even t in dimension two. We determine the minimum length of hyperbolic cross t squared-design curves in dimension two. For d at least3, we establish lower bounds of optimal order for the length of hyperbolic cross t d-design curves. Finally, we obtain lower bounds of optimal order for the length of t-design curves associated with sparse frequency sets.
Sources
- Short spherical $t$-design curves
- Positive quadrature and mobile sampling of multivariate trigonometric polynomials
- Asymptotically optimal $t$-design curves on $S^3$
Related papers
- Do physics-informed neural networks (PINNs) need to be deep? Shallow PINNs using the Levenberg-Marquardt algorithm
- A Neural-preconditioned Poisson Solver for Mixed Dirichlet and Neumann Boundary Conditions
- Advanced Linear Algebra with Applications - Part I (Numerical linear algebra for PDEs, machine learning, and data assimilation)
- Operator learning meets inverse problems: A probabilistic perspective
- Second-order consistency for learning chaotic dynamics via randomized Jacobian matching
- Windowed thinning and query complexity for the bouncy particle and Zigzag samplers