RUS  ENG
Full version
JOURNALS // Izvestiya Rossiiskoi Akademii Nauk. Seriya Matematicheskaya // Archive

Izv. RAN. Ser. Mat., 2022 Volume 86, Issue 4, Pages 162–174 (Mi im9137)

This article is cited in 1 paper

Maltsev equal-norm tight frames

S. Ya. Novikov, V. V. Sevost'yanova

Samara National Research University

Abstract: A frame in $\mathbb{R}^d$ is a set of $n\geqslant d$ vectors whose linear span coincides with $\mathbb{R}^d$. A frame is said to be equal-norm if the norms of all its vectors are equal. Tight frames enable one to represent vectors in $\mathbb{R}^d$ in the form closest to the representation in an orthonormal basis. Every equal-norm tight frame is a useful tool for constructing efficient computational algorithms. The construction of such frames in $\mathbb{C}^d$ uses the matrix of the discrete Fourier transform, and the first constructions of equal-norm tight frames in $\mathbb{R}^d$ appeared only at the beginning of the 21st century. The present paper shows that Maltsev's note of 1947 was decades ahead of its time and turned out to be missed by the experts in frame theory, and Maltsev should be credited for the world's first design of an equal-norm tight frame in $\mathbb{R}^d$. Our main purpose is to show the historical significance of Maltsev's discovery. We consider his paper from the point of view of the modern theory of frames in finite-dimensional spaces. Using the Naimark projectors and other operator methods, we study important frame-theoretic properties of the Maltsev construction, such as the equality of moduli of pairwise scalar products (equiangularity) and the presence of full spark, that is, the linear independence of any subset of $d$ vectors in the frame.

Keywords: matrix, equal-norm tight frame, analysis operator, synthesis operator, orthogonal rows of a matrix, equiangular frame, full spark.

UDC: 517.982.254

MSC: 42C15, 46C05, 15B99

Received: 29.12.2020
Revised: 25.05.2021

DOI: 10.4213/im9137


 English version:
Izvestiya: Mathematics, 2022, 86:4, 770–781

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024