Block Combinatorics

Simple item page
dc.creatorFarmaki, V.
dc.creatorNegrepontis, S.
dc.date2004-06-09
dc.date.accessioned2026-07-07T05:09:05Z
dc.date.available2026-07-07T05:09:05Z
dc.descriptionIn this paper we extend the block combinatorics partition theorems of Hindman and Milliken in the setting of the recursive system of the block Schreier families (B^xi) consisting of families defined for every countable ordinal xi. Results contain (a) a block partition Ramsey theorem for every countable ordinal xi (Hindman's theorem corresponding to xi=1, and Milliken's theorem to xi a finite ordinal), (b) a countable ordinal form of the block Nash-Williams partition theorem, and (c) a countable ordinal block partition theorem for sets closed in the infinite block analogue of Ellentuck's topology.
dc.description26 pages, AMS-LaTeX
dc.identifierhttps://arxiv.org/abs/math/0406188
dc.identifierhttp://arxiv.org/abs/math/0406188
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/71505
dc.subjectCombinatorics
dc.subjectFunctional Analysis
dc.subject05D10; 46B20
dc.titleBlock Combinatorics
dc.typetext

Files

Collections

arXiv