Back to search

Rowan University

Partitions of finite frames

Abstract

dc:description.abstract

An open question stated by Marcus, Spielman, and Srivastava [10] asks "whether one can design an efficient algorithm to find the partitions guaranteed by Corollary 1.5." This corollary states that given a set of vectors in C whose outer products sum to the identity there exists a partition of these vectors such that norms of the outer-product sums of each subset satisfy an inequality bound. Here particular types of vector sets called finite frames are analyzed and constructed to satisfy the inequality described in Corollary 1.5. In this thesis, rigorous proofs and formulations of outer-product norms are utilized to find these partitions and to identify constraints on the finite frames in order to satisfy Corollary 1.5.

Degree

thesis:*
Name thesis:degree_name
M.A. Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Mathematics

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Rosado, James Michael
Contributors dc:contributor
  • Nguyen, Hieu
  • Czochor, Ronald
  • Osler, Thomas

Subjects

dc:subject × 6

Identifiers

dc:identifier.*
Repository record dc:identifier
https://rdw.rowan.edu/etd/1560

Chain of custody

source
Harvested from
Rowan University
Base URL
rdw.rowan.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Rosado, James Michael. Partitions of finite frames. Thesis thesis, https://rdw.rowan.edu/etd/1560