F-finite embeddabilities of sets and ultrafilters

From MaRDI portal
Publication:506964

DOI10.1007/S00153-016-0489-4zbMATH Open1354.05139DBLPjournals/aml/Baglini16arXiv1401.6518OpenAlexW2403004048WikidataQ59461558 ScholiaQ59461558MaRDI QIDQ506964FDOQ506964


Authors: Lorenzo Luperi Baglini Edit this on Wikidata


Publication date: 2 February 2017

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Abstract: Let S be a semigroup, let ninmathbbN be a positive natural number, let A,BsubseteqS, let and let let mathcalFsubseteqf:SnightarrowS. We say that A is mathcalF-finitely embeddable in B if for every finite set FsubseteqA there is a function finmathcalF such that fleft(Anight)subseteqB, and we say that mathcalU is mathcalF-finitely embeddable in mathcalV if for every set BinmathcalV there is a set AinmathcalU such that A is mathcalF-finitely embeddable in B. We show that mathcalF-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 mathcalF-finite embeddability, whose existence is proved under very mild assumptions. Different choices of mathcalF 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 mathcalF-finite embeddability can be characterized algebraically in terms of mathcalF. 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 mathcalF-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.


Full work available at URL: https://arxiv.org/abs/1401.6518




Recommendations




Cites Work


Cited In (9)





This page was built for publication: \(\mathcal {F}\)-finite embeddabilities of sets and ultrafilters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506964)