Syndetic Sets, Paving, and the Feichtinger Conjecture

Details Syndetic Sets, Paving, and the Feichtinger Conjecture Syndetic Sets, Paving, and the Feichtinger Conjecture

2010-01-25

arxiv.org/abs/1001.4510v1

Mathematics

Operator Algebras

Scientific paper

We prove that if a Bessel sequence in a Hilbert space, that is indexed by a countably infinite group in an invariant manner, can be partitioned into finitely many Riesz basic sequences, then each of the sets in the partition can be chosen to be syndetic. We then apply this result to prove that if a Fourier frame for a measurable subset of a higher dimensional cube can be partitioned into Riesz basic sequences, then each subset can be chosen to be a syndetic subset of the corresponding higher dimensional integer lattice. Both of these results follow from a result about syndetic pavings of elements of the von Neumann algebra of a discrete group.

Affiliated with

Also associated with

No associations

Rating

Syndetic Sets, Paving, and the Feichtinger Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Syndetic Sets, Paving, and the Feichtinger Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Syndetic Sets, Paving, and the Feichtinger Conjecture will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-131576