A combinatorial proof of a stronger dense hindman theorem
Abstract
Drawing on ideas of H. Towsner we prove, by elementary methods, that for any finite partition of the natural numbers some cell is a D-set, i.e. a member of some ultrafilter all of whose members have positive upper Banach density.
Publication Title
Colloquium Mathematicum
Recommended Citation
McCutcheon, R. (2020). A combinatorial proof of a stronger dense hindman theorem. Colloquium Mathematicum, 162 (2), 303-310. https://doi.org/10.4064/cm8106-12-2019
COinS
