Centre for Discrete and Applicable Mathematics

 CDAM Research Report, LSE-CDAM-2007-26

November 2007 (Revised January 2009)

Infinite Combinatorics in Function Spaces

N. H. Bingham and A. J. Ostaszewski

The infinite combinatorics here give statements in which, from some sequence, an infinite subsequence will satisfy some condition---for example, belong to some specied set. Our results give such statements generically---that is, for `nearly all' points, or as we shall say, for quasi all points--- all off a null set in the measure case, or all off a meagre set in the category case. The prototypical result here goes back to Kestelman in 1947 and to Borwein and Ditor in the measure case, and can be extended to the category case also. Our main result is what we call the Category Embedding Theorem (CET), which contains the Kestelman-Borwein-Ditor Theorem (KBD) as a special case. Our main contribution is to obtain functionwise rather than pointwise versions of such results. We thus subsume results in a number of recent and related areas, concerning e.g. additive, subadditive, convex and regularly varying functions.

A PDF file (168 kB) with the full contents of this report can be downloaded by clicking here.

Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2007-26, together with your name and postal address to:
CDAM Research Reports Series
Centre for Discrete and Applicable Mathematics
London School of Economics
Houghton Street
London WC2A 2AE, U.K.
Phone: +44(0)-20-7955 7494.
Fax: +44(0)-20-7955 6877.
Email: info@maths.lse.ac.uk 

Introduction to the CDAM Research Report Series.
CDAM Homepage.

Copyright © London School of Economics & Political Science 2007