Sufficient conditions for factor posets of frames in R^n and their graph associations
This paper is on the study of factor posets of frames.\N\NA poset \(P\subseteq 2^I\) for an index set \(I\) is a collection of subsets of \(I\) ordered by set inclusion. Given a finite frame \(F=\{f_i\}_{i\in I}\) in \(\mathbb{R}^n\) with index set \(I\), the factor poset \(\mathbb{F}(F)\subseteq 2^I\) is the collection of subsets \(J\) of \(I\) such that \(\{f_j\}_{j\in J}\) forms a tight frame for \(\mathbb{R}^n\). The empty cover, \(EC(F)\), of \(F\), is the collection of index sets in \(\mathbb{F}(F)\) of prime tight subframes:\N\[\NEC(F):=\{J\in \mathbb{F}: J\neq \emptyset, \nexists J'\in\mathbb{F}(F)\, with\, \emptyset\subsetneq J'\subsetneq J\}.\N\]\NThe paper first considers the sufficient conditions for the inverse factor poset problem in \(\mathbb{R}^n\). It shows that for \(P\) a poset with its empty cover \(EC=\{E_i\}_{i=1}^m\), there exists an \(n\)-dimensional frame whose factor poset is \(P\) if \(|E_i|\ge n\) for all \(i=1,\ldots, m\) and for each \(i\), \(E_i\) intersects at most one other empty cover element.\N\NThe paper then considers the necessary conditions for the inverse factor poset problem in \(\mathbb{R}^n\). It shows that if \(C_{\{i\}}\) consists of only singleton sets, then \(P\) is a factor poset of a frame \(\{f_i\}_{i\in I}\) only if \(|\cup C_{\{i\}: i\in I}|\ge n\), where \(C_A\) denotes the collection of all copies of \(A\) for \(A\subseteq I\).\N\NThe paper also considers how to associate tight frames to the vertices of a given graph \(G\) such that \(G\) becomes the intersection graph of the resulting frame \(F\). A graph \(G\) is called the intersection graph of the frame \(F\) if the vertex set of \(G\) is the empty cover \(EC(F)\) of \(\mathbb{F}(F)\) and the edges are given by the nonempty intersections between pairs of \(EC(F)\). The paper shows an example in \(\mathbb{R}^2\) and demonstrates how to extend it to \(\mathbb{R}^3\), and then a general result shows that any simple graph \(G\) can be an intersection graph of a frame \(F\) in \(\mathbb{R}^n\). Finally, the paper also considers the connection between the independence number of a graph and the maximum number of mutually disjoint index sets of prime tight frames, with estimation of the size of the factor posets of a frame when the graph is a complete \(t\)-partite graph.
- Data-driven tight frame construction and image denoising
- Diagram vectors and tight frame scaling in finite dimensions
- Factor posets of frames and dual frames in finite dimensions
- Finite normalized tight frames
- Frames for undergraduates
- Graph theory
- scientific article; zbMATH DE number 5064374 (Why is no real title available?)
- Maximum robustness and surgery of frames in finite dimensions
- On structural decompositions of finite frames
- Prime tight frames
- Scalable frames
This page was built for publication: Sufficient conditions for factor posets of frames in \(\mathbb{R}^n\) and their graph associations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902634)
