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

Simple item page
dc.creatorLaflamme, Claude
dc.date1995-09-18
dc.date.accessioned2026-07-07T09:15:24Z
dc.date.available2026-07-07T09:15:24Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/math/9509212
dc.identifierhttp://arxiv.org/abs/math/9509212
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/153003
dc.subjectLogic
dc.titleCombinatorial aspects of F(sigma) filters with an application to N-sets
dc.typetext

Files

Collections

arXiv