2000 character limit reached
Combinatorial proofs of Gowers' FIN$_k$ and FIN$_k^\pm$ theorem
Published 25 Feb 2014 in math.CO | (1402.6264v4)
Abstract: A combinatorial proof of a pigeonhole principle of Gowers is found along with its symmetric and approximate version, FIN$_k\pm$ theorem. The proofs do not use of the concept of ultrafilter.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.