Combinatorial aspects of F(sigma) filters with an application to N-sets

Details Combinatorial aspects of F(sigma) filters with an application to N-sets Combinatorial aspects of F(sigma) filters with an application to N-sets

1995-09-18

arxiv.org/abs/math/9509212v1

Mathematics

Logic

Scientific paper

We discuss F(sigma) filters and show that the minimum size of a filter base
generating an undiagonalizable filter included in some F(sigma) filter is the
better known bounded evasion number e(ubd). An application to N-sets from
trigonometric series is given by showing that if A is an N-set and B has size
less e(ubd), then A+B is again an N-set.

Affiliated with

Also associated with

No associations

Rating

Combinatorial aspects of F(sigma) filters with an application to N-sets 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 Combinatorial aspects of F(sigma) filters with an application to N-sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial aspects of F(sigma) filters with an application to N-sets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-84371