F-finite embeddabilities of sets and ultrafilters
From MaRDI portal
Publication:506964
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3657895 (Why is no real title available?)
- scientific article; zbMATH DE number 3559571 (Why is no real title available?)
- scientific article; zbMATH DE number 3405929 (Why is no real title available?)
- A nonstandard technique in combinatorial number theory
- A taste of nonstandard methods in combinatorics of numbers
- Algebra in the Stone-Čech compactification. Theory and applications
- Alpha-theory: An elementary axiomatics for nonstandard analysis
- An ultrafilter approach to Jin's theorem
- Density in arbitrary semigroups
- Embeddability properties of difference sets
- Finite embeddability of sets and ultrafilters
- Iterated hyper-extensions and an idempotent ultrafilter proof of Rado's theorem
- Model theory.
- Multiplicatively large sets and ergodic Ramsey theory
- On a generalization of the van der Waerden theorem
- On rapid idempotent ultrafilters
- Partition regularity of nonlinear polynomials: a nonstandard approach
- Some new results in multiplicative and additive Ramsey theory
- The primes contain arbitrarily long arithmetic progressions
- Ultrafilters and Standard Functions in Non-Standard Arithmetic
- Ultrafilters maximal for finite embeddability
Cited in
(9)- Multiplicative finite embeddability vs divisibility of ultrafilters
- Algebraic characterizations of some relative notions of size
- More about divisibility in βN
- Nonstandard characterisations of tensor products and monads in the theory of ultrafilters
- Finiteness of \(\bigcup_ e \text{Ass}F^ e(M)\) and its connections to tight closure
- Filter spaces: Towards a unified theory of large cardinal and embedding axioms
- Continuous and other finitely generated canonical cofinal maps on ultrafilters
- Ultrafilters maximal for finite embeddability
- Finite embeddability of sets and ultrafilters
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)