Return to Colloquia & Seminar listing
Arithmetic Free Greedily Generated Sequences
Student-Run Discrete Mathematics| Speaker: | Sean O'Rourke, UC Davis |
| Location: | 2112 MSB |
| Start time: | Thu, Nov 8 2007, 3:10AM |
Description
The Greedy algorithm can be used to construct sequences free of arithmetic progressions. This can then be generalized to sequences generated from a seed set. Under certain conditions, these sequences form a regular repeating pattern.