arXiv (All)
open access
Spectral synthesis with the complexity parameter in $\mathbb{Z}_N^d$
We study asymptotic spectral synthesis on $\mathbb Z_N^d$ using the Fourier ratio, the quotient of the counting-measure $\ell^1$ and $\ell^2$ norms of the unitary Fourier transform. For supports of cardinality $N^{α+o(1)}$, the Fourier-ratio concentration exponent satisfies $0\leqκ\leq\fracα{2}$. We
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Optimal Sample Exponents for Direct Discrete-Gaussian SVP Search on Haar Random Lattices#1105367
- The strong converse exponent of composable randomness extraction against quantum side information#1116194
- NP-Hardness of Bounded Distance Decoding for Reed-Solomon Codes#1077049
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- On some $D(u^2)$-triples and quadruples of triangular numbers#1064562
Record · ID 1051897
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive