Search arXiv⌕ Search

arXiv · 2610.38877

Homogeneous polynomial approximation on symmetric convex bodies: A proof of Kroó's conjecture

Abstract

We resolve Kroó's 2004 conjecture on homogeneous polynomial approximation in every dimension, without smoothness or curvature assumptions. For every origin-symmetric convex body $K\subset\mathbb R^d$ with nonempty interior, every continuous real function on $\partial K$ is uniformly approximated by sums of homogeneous polynomials of degrees $n$ and $n+1$ as $n\to\infty$. Moreover, approximation of the constant function by homogeneous polynomials of degree $2n$ is uniform over all such bodies in each fixed dimension. Via homogenization, we also resolve Kroó's 2019 weighted approximation conjecture for every convex admissible weight on Euclidean space. The key construction produces homogeneous polynomials with a common Gaussian boundary profile and localization errors controlled by arbitrary polynomial weights. Its analytic core is a weighted Gaussian approximation theorem: for \(d\ge2\), sufficiently broad Gaussians on $\mathbb R^{d-1}$ can be approximated by $e^{-f}F$, where $f$ is nonnegative, convex and Lipschitz with $f(0)=0$, and $F$ is a Schwartz function with Fourier support in an arbitrarily small ball about the origin. Small Fourier support allows Taylor truncation to a lower degree, while the remainder enforces decay through homogenization. We then use positive spherical quadrature and degree raising to yield the full approximation theorem.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Matthew J. Colbrook. 2026-10-28. Homogeneous polynomial approximation on symmetric convex bodies: A proof of Kroó's conjecture. https://arxiv.org/abs/2610.38877

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A continuous scale space of diffeomorphisms

In this paper, we define and study a nested family of reproducing kernel Hilbert spaces of vector fields that is indexed by a range of scales, from which we construct a reproducing kernel Hilbert space of scale-dependent vector fields. We provide a characterization of the reproducing kernel of that space, with numerical approximations ensuring quick evaluations when this kernel does not have a closed form. We then introduce a multiscale version of the large deformation diffeomorphic metric mapping (LDDMM) problem and prove the existence of solutions. Finally, we provide numerical experiments performing landmark matching using multiscale LDDMM.

math.NA↗

Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation

In this paper, we introduce hierarchical matrices with Tucker blocks (HMTB) for data-sparse approximation of matrices arising from nonoscillatory and mildly oscillatory kernels. Building on the hierarchical matrix framework, HMTB matrices replace conventional low-rank blocks with Tucker representations. Using high-dimensional interpolation and tensor compression and contractions, we develop algorithms for constructing HMTB matrices and performing matrix-vector multiplication. For an $N \times N$ matrix, these algorithms have linear and quasi-linear complexities in $N$, respectively. Numerical comparisons with an interpolation-based $\mathcal{H}$-matrix implementation demonstrate storage savings and, in several cases, reduced construction times, while maintaining competitive forward-evaluation costs. The framework is also applicable to quasi-uniform grids.

math.NA↗

Data-driven model order reduction for wave propagation in materials with damage and nonlinearities

In this work, we consider wave propagation in materials characterized by nonlinear properties or damage. To accelerate the simulations of the resulting high-dimensional problems, we apply model order reduction methods. Depending on the knowledge of the underlying equations and the availability of their discrete operators, intrusive methods (here projection-based approaches based on proper orthogonal decomposition (POD)) or non-instrusive methods (here data-driven approaches including dynamic mode decomposition (DMD) and operator inference (OpInf)) can be used. We recall the theoretical foundations of the methods and apply them to the problem of wave propagation. In three different numerical examples, we evaluate the performance of the reduction techniques.

math.NA↗