|
Organizers |
F\sigma Filters and a Few Applications
by
Claude Laflamme
University of Calgary
We describe the exact combinatorics required to diagonalize F\sigma filters and show in particular that the minimum size of a non trivial F\sigma filter is at least t.
We then discuss a few applications. The first one is related to trigonometric series and the closure of N sets under addition. The other generalizes the notion of a \gamma set using filters on N.
Date received: April 12, 1996
Copyright © 1996 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caae-52.