Rado equations solved by linear combinations of idempotent ultrafilters
From MaRDI portal
Publication:2052576
Recommendations
- Ultrafilters on Abelian groups close to being Ramsey ultrafilters
- Ramsey algebras and the existence of idempotent ultrafilters
- Strongly summable ultrafilters on abelian groups
- Strongly summable ultrafilters on \({\mathbb{N}}\) and small maximal subgroups of \(\beta\) \({\mathbb{N}}\)
- On rapid idempotent ultrafilters
- Ultrafilters on words for a fragment of logic
- The number of near-coherence classes of ultrafilters is either finite or \(2^{\mathfrak c}\)
- Idempotent ultrafilters without Zorn's lemma
- On strongly summable ultrafilters
Cites work
- Algebra in the Stone-Čech compactification: theory and applications
- Fermat-like equations that are not partition regular
- Forcing and stable ordered–union ultrafilters
- Idempotent ultrafilters, multipleweak mixing and Szemerédi's theorem for generalized polynomials
- Idempotents in \(\beta S\) that are only products trivially
- Iterated hyper-extensions and an idempotent ultrafilter proof of Rado's theorem
- Nonstandard characterisations of tensor products and monads in the theory of ultrafilters
- Partition regularity of nonlinear polynomials: a nonstandard approach
- Partition regularity of polynomial systems near zero
- Ramsey properties of nonlinear Diophantine equations
- SEPARATING MILLIKEN–TAYLOR SYSTEMS WITH NEGATIVE ENTRIES
- Solvability of Rado systems in \(D\)-sets
- Strongly productive ultrafilters on semigroups
- Strongly summable ultrafilters on abelian groups
- Studien zur Kombinatorik
- The Shelah P-point independence theorem
Cited in
(2)
This page was built for publication: Rado equations solved by linear combinations of idempotent ultrafilters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052576)