Ramsey and Nash-Williams combinatorics via Schreier families
| dc.creator | Farmaki, Vassiliki | |
| dc.date | 2004-04-01 | |
| dc.date.accessioned | 2026-07-07T05:06:58Z | |
| dc.date.available | 2026-07-07T05:06:58Z | |
| dc.description | The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence Galvin-Prikry's partition theorem. The proper tool for this unification of the classical partition theorems at a more general and stronger level is the system of Schreier families $({\cal A}_ξ)$ of finite subsets of the set of natural numbers, defined for every countable ordinal $ξ$. | |
| dc.description | 28 pages, preliminary version | |
| dc.identifier | https://arxiv.org/abs/math/0404014 | |
| dc.identifier | http://arxiv.org/abs/math/0404014 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/70678 | |
| dc.subject | Functional Analysis | |
| dc.subject | Primary 05D10; Secondary 05C55 | |
| dc.title | Ramsey and Nash-Williams combinatorics via Schreier families | |
| dc.type | text |