Ramsey Theory for Words over an Infinite Alphabet
| dc.creator | Farmaki, Vassiliki | |
| dc.date | 2009-04-13 | |
| dc.date.accessioned | 2026-07-07T13:03:24Z | |
| dc.date.available | 2026-07-07T13:03:24Z | |
| dc.description | A complete partition theory is presented for omega-located words (and omega-words), namely for located words over an infinite alphabet dominated by a fixed increasing sequence. This theory strengthens in an essential way the classical Carlson, Furstenberg-Katznelson, and Bergelson-Blass-Hindman partition theory for words over a finite alphabet. Consequences of this theory are strong simultaneous extensions of the classical Hindman, Milliken-Taylor partition theorem, and of a van der Waerden theorem for general semigroups, extending results of Hindman-Strauss and Beiglbock. | |
| dc.identifier | https://arxiv.org/abs/0904.1948 | |
| dc.identifier | http://arxiv.org/abs/0904.1948 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/226792 | |
| dc.subject | Combinatorics | |
| dc.subject | 05D10 | |
| dc.title | Ramsey Theory for Words over an Infinite Alphabet | |
| dc.type | text |