Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.04892

Matrix Methods for Perfect Signal Recovery Underlying Range Space of Operators

Fahimeh Arabyani Neyshaburi·Rajab Ali Kamyabi-Gol
View original source ↗Read source document ↗Export metadata ↓

Abstract

The most important purpose of this article is to investigate perfect reconstruction underlying range space of operators in finite dimensional Hilbert spaces by matrix methods. To this end, first we obtain more structures of the canonical K-dual. % and survey optimal K-dual problem under probabilistic erasures. Then, we survey the problem of recovering and robustness of signals when the erasure set satisfies the minimal redundancy condition or the K-frame is maximal robust. Furthermore, we show that the error rate is reduced under erasures if the $K$-frame is of uniform excess. Toward the protection of encoding frame (K-dual) against erasures, we introduce a new concept so called $(r,k)$-matrix to recover lost data and solve the perfect recovery problem via matrix equations. Moreover, we discuss the existence of such matrices by using minimal redundancy condition on decoding frames for operators. Finally, we exhibit several examples that illustrate our results and the advantage of using the new matrix with respect to previous approaches in existence and construction.

Explore related subjects

math.FA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fahimeh Arabyani Neyshaburi, Rajab Ali Kamyabi-Gol. 2020-08-11. Matrix Methods for Perfect Signal Recovery Underlying Range Space of Operators. https://arxiv.org/abs/2008.04892

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

KEEP EXPLORING

Related papers

arXiv2026

Fixed Point Rigidity of the Operator $Γ_pΠ_p^\ast$ and the LYZ Conjecture

We characterize the fixed points of the operator $Γ_pΠ_p^\ast$ for $n\geq 3$ and $1 0$ if and only if $K$ is an origin-centered ellipsoid, thereby settling the Lutwak--Yang--Zhang fixed-point conjecture in this range. Our proof is based on a variational analysis along linear reflection shadow systems. To address the nonlinear structure of the $L_p$ setting, we introduce the $L_p$-Projection Rolodex, which provides a dimensional reduction of the volume of the polar $L_p$-projection body to weighted lower-dimensional sectional functionals. A suitable change of variables, together with Ball's harmonic Prékopa--Leindler inequality, yields the convexity needed along the shadow system. Under the fixed-point condition, a first-variation identity then forces $\operatorname{vol}_n(Π_p^\ast K_t)$ to remain constant throughout the deformation. The rigidity statement follows from the equality characterization under Steiner symmetrization.

math.FA↗
arXiv2026

Compactness of Toeplitz Operators on the Bergman Space

Let $φ\in L^\infty(\D)$. We study compactness criteria for \(T_φ\) on the Bergman space $A^2(\D)$. Axler and Zheng~\cite{AZ1998} established a necessary and sufficient condition for compactness in terms of the Berezin transform. For a general bounded measurable function $φ$, however, its Berezin transform $\tildeφ$ does not readily reveal the intrinsic properties of $φ$. Motivated by a characterization in terms of the symbol itself, Zhu~\cite{ZhuSlides} proposed a conjecture on compact Toeplitz operators. In this paper, we characterize compactness of $T_φ$ on the unweighted Bergman space in terms of local averages of the symbol. We prove that compactness is equivalent to the vanishing of averages over Bergman disks of any prescribed fixed radius. We also establish an equivalent criterion in terms of Carleson box averages that tend to zero uniformly in the angular variable. Finally, we construct a nonnegative bounded symbol whose Carleson box averages tend to zero at every fixed angle, although the associated Toeplitz operator is not compact.

math.FA↗
arXiv2026

Order automorphisms of partial isometries in $M_n(\mathbb C)$

We investigate and characterize order automorphisms on the set of partial isometries in the finite-dimensional matrix algebra $M_n(\mathbb{C})$. Different from the classical order automorphisms of subspace lattices, which can be implemented by standard invertible or unitary transformations, the order automorphisms considered herein admit no such conventional matrix representations. Instead, they are essentially governed by matrices such that $I-(A+A^*)$ is either positive or negative invertible. The results reveal that the structural features of order automorphisms for partial isometries are substantially more intricate than those of classical subspace automorphisms.

math.FA↗