English

Spectral synthesis with the complexity parameter

Classical Analysis and ODEs 2026-03-30 v1 Spectral Theory

Abstract

We show that spectral synthesis thresholds are governed by a quantitative spectral complexity parameter, the Fourier Ratio, in addition to the geometric size of the Fourier support. In the Euclidean setting, we prove that if a compactly supported measure has finite α\alpha-dimensional packing measure and the associated Fourier ratio decays with asymptotic exponent κ\kappa, then the classical synthesis threshold improves from 2dα\frac{2d}{\alpha} to 2(d2κ)α2κ\frac{2(d-2\kappa)}{\alpha-2\kappa}. We then establish an analogous result on compact Riemannian manifolds without boundary. In that setting the relevant object is a localized spectral Fourier ratio defined using Laplace--Beltrami spectral projectors. The resulting synthesis threshold is again determined by the decay exponent of this complexity parameter. These results place Euclidean and manifold spectral synthesis into a common framework in which geometric size and spectral complexity jointly govern uniqueness

Keywords

Cite

@article{arxiv.2603.25998,
  title  = {Spectral synthesis with the complexity parameter},
  author = {S. Deodhar and A. Iosevich},
  journal= {arXiv preprint arXiv:2603.25998},
  year   = {2026}
}
R2 v1 2026-07-01T11:40:06.083Z