Mathematics – Combinatorics
Scientific paper
2009-07-16
Mathematics
Combinatorics
7 pages; small typos corrected 10/27/2009
Scientific paper
One of the "deepest" theorems in mathematics is Endre Szemer\'edi's theorem about the inevitability of arithmetical progressions. Here we try to nibble at it, by doing "finite" analogs. This is already interesting for its own sake, but we believe that it has the potential to lead to extremely interesting sharpening of the currently rather weak bounds. Let's hope! Along with introducing the theory behind the finite analogs of Szemer\'edi's Theorem, full Maple, Mathematica, and Java code is provided. See paper for further details.
Raff Paul
Zeilberger Doron
No associations
LandOfFree
Finite Analogs of Szemerédi's Theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite Analogs of Szemerédi's Theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite Analogs of Szemerédi's Theorem will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-621892