Let S be a semigroup, let be a positive natural number, let , let and let let . We say that A is -finitely embeddable in B if for every finite set there is a function such that , and we say that is -finitely embeddable in if for every set there is a set such that A is -finitely embeddable in B. We show that -finite embeddabilities can be used to study certain combinatorial properties of sets and ultrafilters related with finite structures. We introduce the notions of set and of ultrafilter maximal for -finite embeddability, whose existence is proved under very mild assumptions. Different choices of can be used to characterize many combinatorially interesting sets/ultrafilters as maximal sets/ultrafilters, for example thick sets, AP-rich sets, and so on. The set of maximal ultrafilters for -finite embeddability can be characterized algebraically in terms of . This property can be used to give an algebraic characterization of certain interesting sets of ultrafilters, such as the ultrafilters whose elements contain, respectively, arbitrarily long arithmetic, geoarithmetic or polynomial progressions. As a consequence of the connection between sets and ultrafilters maximal for -finite embeddability we are able to prove a general result that entails, for example, that given a finite partition of a set that contains arbitrarily long geoarithmetic (resp. polynomial) progressions, one cell must contain arbitrarily long geoarithmetic (resp. polynomial) progressions. Finally we apply -finite embeddabilities to study a few properties of homogeneous partition regular diophantine equations. Some of our results are based on connections between ultrafilters and nonstandard models of arithmetic.
F-finite embeddabilities of sets and ultrafilters / L. Luperi Baglini. - In: ARCHIVE FOR MATHEMATICAL LOGIC. - ISSN 0933-5846. - 55:5-6(2016), pp. 705-734. [10.1007/s00153-016-0489-4]
F-finite embeddabilities of sets and ultrafilters
L. Luperi Baglini
2016
Abstract
Let S be a semigroup, let be a positive natural number, let , let and let let . We say that A is -finitely embeddable in B if for every finite set there is a function such that , and we say that is -finitely embeddable in if for every set there is a set such that A is -finitely embeddable in B. We show that -finite embeddabilities can be used to study certain combinatorial properties of sets and ultrafilters related with finite structures. We introduce the notions of set and of ultrafilter maximal for -finite embeddability, whose existence is proved under very mild assumptions. Different choices of can be used to characterize many combinatorially interesting sets/ultrafilters as maximal sets/ultrafilters, for example thick sets, AP-rich sets, and so on. The set of maximal ultrafilters for -finite embeddability can be characterized algebraically in terms of . This property can be used to give an algebraic characterization of certain interesting sets of ultrafilters, such as the ultrafilters whose elements contain, respectively, arbitrarily long arithmetic, geoarithmetic or polynomial progressions. As a consequence of the connection between sets and ultrafilters maximal for -finite embeddability we are able to prove a general result that entails, for example, that given a finite partition of a set that contains arbitrarily long geoarithmetic (resp. polynomial) progressions, one cell must contain arbitrarily long geoarithmetic (resp. polynomial) progressions. Finally we apply -finite embeddabilities to study a few properties of homogeneous partition regular diophantine equations. Some of our results are based on connections between ultrafilters and nonstandard models of arithmetic.File | Dimensione | Formato | |
---|---|---|---|
F-finite embeddabilities of Sets and Ultrafilters Luperi Baglini.pdf
accesso aperto
Tipologia:
Post-print, accepted manuscript ecc. (versione accettata dall'editore)
Dimensione
524.26 kB
Formato
Adobe PDF
|
524.26 kB | Adobe PDF | Visualizza/Apri |
LuperiBaglini2016_Article_MathcalFF-finiteEmbeddabilitie.pdf
accesso aperto
Tipologia:
Publisher's version/PDF
Dimensione
624.31 kB
Formato
Adobe PDF
|
624.31 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.