Papers
Topics
Authors
Recent
Search
2000 character limit reached

On colorings of variable words

Published 4 Sep 2014 in math.CO | (1409.1471v1)

Abstract: In this note, we prove that the base case of the Graham--Rothschild Theorem, i.e., the one that considers colorings of the ($1$-dimensional) variable words, admits bounds in the class $\mathcal{E}5$ of Grzegorczyk's hierarchy.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Konstantinos Tyros 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up