Abstract
In this article, we give two proofs of Carlson's theorem for located words in~. The first proof is purely combinatorial, in the style of Towsner's proof of Hindman's theorem. The second uses topological dynamics to show that an iterated version of Hindman's theorem for bounded sums implies Carlson's theorem for located words.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.