On spectrally optimal duals of frames generated by graphs
Functional Analysis
2024-06-04 v1 Combinatorics
Abstract
Recently, the concept of frames generated by graphs has been introduced in \cite{D}. In this paper, we study spectrally optimal dual frames of frames generated by graphs. We show that if the frame is generated by a connected graph, then its canonical dual frame is the unique spectrally optimal dual frame for -erasure and -erasures. Further, we show that the canonical dual frames of frames generated by disconnected graphs are non-unique spectrally optimal dual frames for -erasure and -erasures.
Keywords
Cite
@article{arxiv.2406.00776,
title = {On spectrally optimal duals of frames generated by graphs},
author = {Deepshikha and Aniruddha Samanta},
journal= {arXiv preprint arXiv:2406.00776},
year = {2024}
}
Comments
21 pages, 1 figure. arXiv admin note: text overlap with arXiv:2405.18189. arXiv admin note: text overlap with arXiv:2405.18189