We study tight projective 2‐designs in three different settings. In the complex setting, Zauner's conjecture predicts the existence of a tight projective 2‐design in every dimension. Pandey, Paulsen, Prakash, and Rahaman recently proposed an approach to make quantitative progress on this conjecture in terms of the entanglement breaking rank of a certain quantum channel. We show that this quantity is equal to the size of the smallest weighted projective 2‐design. Next, in the finite field setting, we introduce a notion of projective 2‐designs, we characterize when such projective 2‐designs are tight, and we provide a construction of such objects. Finally, in the quaternionic setting, we show that every tight projective 2‐design for determines an equi‐isoclinic tight fusion frame of subspaces of of dimension 3.
Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher.
Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?
Some links on this page may take you to non-federal websites. Their policies may differ from this site.
-
Abstract -
Abstract Single-cell technologies characterize complex cell populations across multiple data modalities at unprecedented scale and resolution. Multi-omic data for single cell gene expression, in situ hybridization, or single cell chromatin states are increasingly available across diverse tissue types. When isolating specific cell types from a sample of disassociated cells or performing in situ sequencing in collections of heterogeneous cells, one challenging task is to select a small set of informative markers that robustly enable the identification and discrimination of specific cell types or cell states as precisely as possible. Given single cell RNA-seq data and a set of cellular labels to discriminate, scGeneFit selects gene markers that jointly optimize cell label recovery using label-aware compressive classification methods. This results in a substantially more robust and less redundant set of markers than existing methods, most of which identify markers that separate each cell label from the rest. When applied to a data set given a hierarchy of cell types as labels, the markers found by our method improves the recovery of the cell type hierarchy with fewer markers than existing methods using a computationally efficient and principled optimization.
-
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 distance. We introduce our program in terms of general Schurian association schemes before focusing on the special case of Gelfand pairs. Notably, our program unifies a variety of existing packings with heretofore disparate constructions. In addition, we leverage our program to construct the first known infinite family of equiangular lines with Heisenberg symmetry.more » « less
-
It is often of interest to identify a given number of points in projective space such that the minimum distance between any two points is as large as possible. Such configurations yield representations of data that are optimally robust to noise and erasures. The minimum distance of an optimal configuration not only depends on the number of points and the dimension of the projective space, but also on whether the space is real or complex. For decades, Neil Sloane’s online Table of Grassmannian Packings has been the go-to resource for putatively or provably optimal packings of points in real projective spaces. Using a variety of numerical algorithms, we have created a similar table for complex projective spaces. This paper surveys the relevant literature, explains some of the methods used to generate the table, presents some new putatively optimal packings, and invites the reader to competitively contribute improvements to this table.more » « less