English
Related papers

Related papers: Achieving the orthoplex bound and constructing wei…

200 papers

In this paper, we focus on frames of operators or K-frames on Hilbert spaces in Parseval cases. Since equal-norm tight frames play important roles for robust data transmission, we aim to study this topics on Parseval K-frames. We will show…

Functional Analysis · Mathematics 2021-04-26 Vahid Sadri , Gholamreza Rahimlou

Let L be an ample holomorphic line bundle over a compact complex Hermitian manifold X. Any fixed smooth Hermitian metric on L induces a Hilbert space structure on the space of global holomorphic sections with values in the k:th tensor power…

Complex Variables · Mathematics 2007-05-23 Robert Berman

We consider existence and uniqueness of symmetric approximation of frames by normalized tight frames and of symmetric orthogonalization of bases by orthonormal bases in Hilbert spaces H . More precisely, we determine whether a given frame…

Functional Analysis · Mathematics 2025-05-08 M. Frank , V. I. Paulsen , T. R. Tiballi

A remarkable coincidence has led to the discovery of a family of packings of (m^2+m-2) m/2-dimensional subspaces of m-dimensional space, whenever m is a power of 2. These packings meet the ``orthoplex bound'' and are therefore optimal.

Combinatorics · Mathematics 2007-05-23 P. W. Shor , N. J. A. Sloane

The tubal tensor framework provides a clean and effective algebraic setting for tensor computations, supporting matrix-mimetic features like Singular Value Decomposition and Eckart-Young-like optimality results. Underlying the tubal tensor…

Numerical Analysis · Mathematics 2025-04-25 Uria Mor , Haim Avron

Let $\mathcal{H}$ be a (separable) Hilbert space and $\{e_k\}_{k\geq 1}$ a fixed orthonormal basis of $\mathcal{H}$. Motivated by many papers on scaled projections, angles of subspaces and oblique projections, we define and study the notion…

Functional Analysis · Mathematics 2007-05-23 Jorge Antezana , Gustavo Corach , Mariano Ruiz , Demetrio Stojanoff

We provide a general program for finding nice arrangements of points in real or complex projective space from transitive actions of finite groups. In many cases, these arrangements are optimal in the sense of maximizing the minimum…

Functional Analysis · Mathematics 2017-09-13 Joseph W. Iverson , John Jasper , Dustin G. Mixon

Finite frames, or spanning sets for finite-dimensional Hilbert spaces, are a ubiquitous tool in signal processing. There has been much recent work on understanding the global structure of collections of finite frames with prescribed…

Functional Analysis · Mathematics 2023-09-14 Tom Needham , Clayton Shonkwiler

Weaving Hilbert space frames have been introduced recently by Bemrose et al. to deal with some problems in distributed signal processing. In this paper, we survey this topic from the viewpoint of the duality principle, so we obtain new…

Functional Analysis · Mathematics 2019-09-20 Fahimeh Arabyani Neyshaburi , Ali Akbar Arefijamaal

We study the problem of discrete geometric packing. Here, given weighted regions (say in the plane) and points (with capacities), one has to pick a maximum weight subset of the regions such that no point is covered more than its capacity.…

Computational Geometry · Computer Science 2011-12-01 Alina Ene , Sariel Har-Peled , Benjamin Raichel

We consider frames in a finite-dimensional Hilbert space Hn where frames are exactly the spanning sets of the vector space. The diagram vector of a vector in R2 was previously defined using polar coordinates and was used to characterize…

It's known that if $d^2$ vectors from $d$-dimensional Hilbert space $H$ form a SIC-POVM (SIC for short) then tensor square of those vectors form an equiangular tight frame on the symmetric subspace of $H\otimes H$. We prove that for any SIC…

Quantum Physics · Physics 2022-02-17 Vasyl Ostrovskyi , Danylo Yakymenko

Outer product frames are important objects in Hilbert space frame theory. But very little is known about them. In this paper, we make the first detailed study of the family of outer product frames induced directly by vector sequences. We…

Functional Analysis · Mathematics 2014-10-31 Peter G. Casazza , Eric Pinkham , Brian Tuomanen

Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition tasks. However, it also incurs challenges arising from the fact that linear subspaces do not obey Euclidean geometry, but lie on a special…

Computer Vision and Pattern Recognition · Computer Science 2014-07-07 Mehrtash T. Harandi , Mathieu Salzmann , Sadeep Jayasumana , Richard Hartley , Hongdong Li

We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…

Combinatorics · Mathematics 2018-05-28 Emily J. King , Xiaoxian Tang

In this paper, we study conditions under which a finite subset $Z$ of the unit sphere $S^{d-1}\subset \mathbb{R}^{d}$ becomes a spherical $t$-design, when $Z$ is constructed by the following procedure: starting from a finite set of…

Combinatorics · Mathematics 2026-01-27 Ryutaro Misawa

We provide a new method for constructing equiangular tight frames (ETFs). The construction is valid in both the real and complex settings, and shows that many of the few previously-known examples of ETFs are but the first representatives of…

Functional Analysis · Mathematics 2010-09-30 Matthew Fickus , Dustin G. Mixon , Janet C. Tremain

An Equiangular tight frame (ETF) - also known as the Welch-bound-equality sequences - consists of a sequence of unit norm vectors whose absolute inner product is identical and minimal. Due to this unique property, these frames are preferred…

Signal Processing · Electrical Eng. & Systems 2021-10-26 R. Jyothi , P. Babu

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…

Metric Geometry · Mathematics 2019-11-07 Fernando Mário de Oliveira Filho , Frank Vallentin

In the Two-dimensional Bin Packing (2BP) problem, we are given a set of rectangles of height and width at most one and our goal is to find an axis-aligned nonoverlapping packing of these rectangles into the minimum number of unit square…

Computational Geometry · Computer Science 2021-05-07 Arindam Khan , Eklavya Sharma