Andrés Eduardo Caicedo

Learn More
We compute an explicit upper bound for the regressive Ramsey numbers by a combina-torial argument, the corresponding function being of Ackermannian growth. For this, we look at the more general problem of bounding g(n, m), the least l such that any regres-sive function f : [m, l] [2] → N admits a min-homogeneous set of size n. Analysis of this function also(More)
The following individuals read and discussed the thesis submitted by student Rachel Elizabeth Byrd, and they evaluated her presentation and response to questions during the final oral examination. They found that the student passed the final oral examination. ABSTRACT The Dehn complex of prime, alternating virtual links has been shown to be non-positively(More)
The following individuals read and discussed the thesis submitted by student Nicholas Davidson, and they evaluated his presentation and response to questions during the …nal oral examination. They found that the student passed the …nal oral examination. ABSTRACT In 1964, Paul Cohn showed that if F is a …nitely-generated free group, and Q a …eld, then all(More)
The following individuals read and discussed the thesis submitted by student Bailey Ann Ross, and they evaluated her presentation and response to questions during the final oral examination. They found that the student passed the final oral examination. ABSTRACT The genus of a graph is the minimal genus of a surface into which the graph can be embedded.(More)
  • 1