Combinatorial proofs of Gowers' FIN$_k$ and FIN$_k^\pm$ theorem
Combinatorics
2019-10-04 v4
Abstract
A combinatorial proof of a pigeonhole principle of Gowers is found along with its symmetric and approximate version, FIN theorem. The proofs do not use of the concept of ultrafilter.
Keywords
Cite
@article{arxiv.1402.6264,
title = {Combinatorial proofs of Gowers' FIN$_k$ and FIN$_k^\pm$ theorem},
author = {Ryszard Frankiewicz and Sławomir Szczepaniak},
journal= {arXiv preprint arXiv:1402.6264},
year = {2019}
}
Comments
An error in Lemma 1