English
Related papers

Related papers: Tight frames and related geometric problems

200 papers

Tightness of a triangulated manifold is a topological condition, roughly meaning that any simplexwise linear embedding of the triangulation into euclidean space is "as convex as possible". It can thus be understood as a generalization of…

Geometric Topology · Mathematics 2011-03-04 Felix Effenberger

This article studies a large, general class of orthogonal polytopes which we may call "generic orthotopes". These objects emerged from a desire to represent a Coxeter complex by an orthogonal polytope that is particularly nice with respect…

Combinatorics · Mathematics 2022-10-24 David Richter

Finite unit norm tight frames provide Parseval-like decompositions of vectors in terms of redundant components of equal weight. They are known to be exceptionally robust against additive noise and erasures, and as such, have great potential…

Functional Analysis · Mathematics 2010-09-29 Peter G. Casazza , Matthew Fickus , Dustin G. Mixon

Equiangular tight frames provide optimal packings of lines through the origin. We combine Steiner triple systems with Hadamard matrices to produce a new infinite family of equiangular tight frames. This in turn leads to new constructions of…

Functional Analysis · Mathematics 2017-06-29 Matthew Fickus , John Jasper , Dustin G. Mixon , Jesse Peterson

Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing moment. Namely,…

Functional Analysis · Mathematics 2012-07-10 Maria Charina , Mihai Putinar , Claus Scheiderer , Joachim Stoeckler

We characterize the frames on an infinite dimensional separable Hilbert space that can be projected to a tight frame for an infinite dimensional subspace. A result of Casazza and Leon states that an arbitrary frame for a 2N- or…

Functional Analysis · Mathematics 2012-11-15 John Jasper

Based on the shearlet transform we present a general construction of continuous tight frames for $L^2(\mathbb{R}^2)$ from any sufficiently smooth function with anisotropic moments. This includes for example compactly supported systems,…

Functional Analysis · Mathematics 2010-01-12 Philipp Grohs

We discuss some specializations of the frames of flat orthonormal frame bundles over geometries of indefinite signature, and the resulting symmetries of families of embedded Riemannian or pseudo-Riemannian geometries. The specializations…

General Relativity and Quantum Cosmology · Physics 2013-02-18 Frank B. Estabrook

We study the relationship between operators, orthonormal basis of subspaces and frames of subspaces (also called fusion frames) for a separable Hilbert space $\mathcal{H}$. We get sufficient conditions on an orthonormal basis of subspaces…

Functional Analysis · Mathematics 2011-11-10 Mariano A. Ruiz , Demetrio Stojanoff

Motivated by the dynamical sampling problem, we study frames in an infinite dimensional Hilbert space generated by the iterates of a bounded operator T, also known as dynamical frames. We first characterize the operators that generate…

Functional Analysis · Mathematics 2025-11-19 A. Aguilera , C. Cabrelli , F. Negreira , V. Paternostro

A frame is a system of vectors $S$ in Hilbert space $\mathscr{H}$ with properties which allow one to write algorithms for the two operations, analysis and synthesis, relative to $S$, for all vectors in $\mathscr{H}$; expressed in…

Functional Analysis · Mathematics 2015-01-29 Palle Jorgensen , Feng Tian

We study vectors chosen at random from a compact convex polytope in $\mathbb{R}^n$ given by a finite number of linear constraints. We determine which projections of these random vectors are asymptotically normal as $n\to\infty$. Marginal…

Probability · Mathematics 2025-03-18 Fabrice Gamboa , Martin Venker

This article gives a procedure to convert a frame which is not a tight frame into a Parseval frame for the same space, with the requirement that each element in the resulting Parseval frame can be explicitly written as a linear combination…

Functional Analysis · Mathematics 2013-08-26 Enrico Au-Yeung , Somantika Datta

We introduce a definition of the volume for a general rectangular matrix, which for square matrices is equivalent to the absolute value of the determinant. We generalize results for square maximum-volume submatrices to the case of…

Numerical Analysis · Mathematics 2017-11-28 A. Mikhalev , I. V. Oseledets

Given $n$ weighted points (positive or negative) in $d$ dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorithm for this problem is based on a reduction to a related…

Data Structures and Algorithms · Computer Science 2016-03-04 Arturs Backurs , Nishanth Dikkala , Christos Tzamos

We provide formulas for projectors onto a polyhedral set, i.e. the intersection of a finite number of halfspaces. To this aim we formulate the problem of finding the projection as a convex optimization problem and we solve explicitly…

Optimization and Control · Mathematics 2017-04-20 Krzysztof E. Rutkowski

This thesis is a study of large sets of unit vectors in $\cx^n$ such that the absolute value of their standard inner products takes on only a small number of values. We begin with bounds: what is the maximal size of a set of lines with only…

Combinatorics · Mathematics 2013-06-06 Aidan Roy

This article considers the relation between the spanning properties of lattice orbits of discrete series representations and the associated lattice co-volume. The focus is on the density theorem, which provides a trichotomy characterizing…

Functional Analysis · Mathematics 2021-10-28 José Luis Romero , Jordy Timo van Velthoven

The immensely fruitful concept of Grothendieck topology or covering issued from the efforts of algebraic geometers to study "sheaf-like" objects defined on categories more general than the lattice of open sets on a topological space. In the…

General Relativity and Quantum Cosmology · Physics 2007-05-23 John L. Bell

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