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
Publication date: 2 February 2017
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Abstract: Let be a semigroup, let be a positive natural number, let , let and let let . We say that is -finitely embeddable in 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 is -finitely embeddable in . 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.
Full work available at URL: https://arxiv.org/abs/1401.6518
Recommendations
Ramsey theory (05D10) Structure of topological semigroups (22A15) Nonstandard models in mathematics (03H05)
Cites Work
- Title not available (Why is that?)
- Model theory.
- The primes contain arbitrarily long arithmetic progressions
- Algebra in the Stone-Čech compactification. Theory and applications
- Multiplicatively large sets and ergodic Ramsey theory
- Title not available (Why is that?)
- On rapid idempotent ultrafilters
- An ultrafilter approach to Jin's theorem
- Alpha-theory: An elementary axiomatics for nonstandard analysis
- On a generalization of the van der Waerden theorem
- Some new results in multiplicative and additive Ramsey theory
- Embeddability properties of difference sets
- Title not available (Why is that?)
- A nonstandard technique in combinatorial number theory
- Finite embeddability of sets and ultrafilters
- Ultrafilters maximal for finite embeddability
- A taste of nonstandard methods in combinatorics of numbers
- Iterated hyper-extensions and an idempotent ultrafilter proof of Rado's theorem
- Partition regularity of nonlinear polynomials: a nonstandard approach
- Ultrafilters and Standard Functions in Non-Standard Arithmetic
- Density in arbitrary semigroups
Cited In (9)
- Nonstandard characterisations of tensor products and monads in the theory of ultrafilters
- More about divisibility in βN
- Filter spaces: Towards a unified theory of large cardinal and embedding axioms
- Continuous and other finitely generated canonical cofinal maps on ultrafilters
- Finite embeddability of sets and ultrafilters
- Multiplicative finite embeddability vs divisibility of ultrafilters
- Ultrafilters maximal for finite embeddability
- Algebraic characterizations of some relative notions of size
- Finiteness of \(\bigcup_ e \text{Ass}F^ e(M)\) and its connections to tight closure
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)