22 research outputs found
Constructions of biangular tight frames and their relationships with equiangular tight frames
We study several interesting examples of Biangular Tight Frames (BTFs) -
basis-like sets of unit vectors admitting exactly two distinct frame angles
(ie, pairwise absolute inner products) - and examine their relationships with
Equiangular Tight Frames (ETFs) - basis-like systems which admit exactly one
frame angle.
We demonstrate a smooth parametrization BTFs, where the corresponding frame
angles transform smoothly with the parameter, which "passes through" an ETF
answers two questions regarding the rigidity of BTFs. We also develop a general
framework of so-called harmonic BTFs and Steiner BTFs - which includes the
equiangular cases, surprisingly, the development of this framework leads to a
connection with the famous open problem(s) regarding the existence of Mersenne
and Fermat primes. Finally, we construct a (chordally) biangular tight set of
subspaces (ie, a tight fusion frame) which "Pl\"ucker embeds" into an ETF.Comment: 19 page
The Bourgain-Tzafriri conjecture and concrete constructions of non-pavable projections
It is known that the Kadison-Singer Problem (KS) and the Paving Conjecture
(PC) are equivalent to the Bourgain-Tzafriri Conjecture (BT). Also, it is known
that (PC) fails for -paving projections with constant diagonal . But
the proofs of this fact are existence proofs. We will use variations of the
discrete Fourier Transform matrices to construct concrete examples of these
projections and projections with constant diagonal which are not
-pavable in a very strong sense.
In 1989, Bourgain and Tzafriri showed that the class of zero diagonal
matrices with small entries (on the order of , for an
-dimensional Hilbert space) are
{\em pavable}. It has always been assumed that this result also holds for the
BT-Conjecture - although no one formally checked it. We will show that this is
not the case. We will show that if the BT-Conjecture is true for vectors with
small coefficients (on the order of ) then the BT-Conjecture is
true and hence KS and PC are true
The Kadison-Singer Problem in Mathematics and Engineering
We will show that the famous, intractible 1959 Kadison-Singer problem in
-algebras is equivalent to fundamental unsolved problems in a dozen
areas of research in pure mathematics, applied mathematics and Engineering.
This gives all these areas common ground on which to interact as well as
explaining why each of these areas has volumes of literature on their
respective problems without a satisfactory resolution. In each of these areas
we will reduce the problem to the minimum which needs to be proved to solve
their version of Kadison-Singer. In some areas we will prove what we believe
will be the strongest results ever available in the case that Kadison-Singer
fails. Finally, we will give some directions for constructing a counter-example
to Kadison-Singer