Rado equations solved by linear combinations of idempotent ultrafilters
The paper characterises the solvability of Rado equations inside linear combinations \(a_1\mathcal{U} + \cdots + a_n\mathcal{U}\) of idempotent ultrafilters \(\mathcal{U}\in\beta\mathbb{Z}\) by exploiting known relations between such combinations and strings of integers and generalises a partial characterisation obtained previously by \textit{M. Di Nasso} [Proc. Am. Math. Soc. 143, No. 4, 1749--1761 (2015; Zbl 1386.03057)]. More precisely, a string \((a_1,\ldots , a_n)\in\mathbb{Z}^{<\omega}\) is called reduced if we have: (a) for every \(i\in\{1,\ldots,n - 1\}\), \(a_i\neq a_{i+1}\); and (b) for every \(i\in\{1,\ldots,n\}\), \(a_i\neq 0\). One of the main results in the paper reads as follows: Let \(P \in \mathbb{Z}[x_1,\ldots, x_m]\) be a linear homogeneous polynomial and let \(\sigma \in\mathbb{Z}^{<\omega}\) be a reduced string. Then, under the assumption that there exists a strongly summable ultrafilter on \(\mathbb{Z}\), the following statements are equivalent: 1. For all idempotent ultrafilters \(\mathcal{U}\in\beta\mathbb{Z}\) we have that \[ \sigma\mathcal{U}\models P ( x_1 ,\dots, x_m ) = 0. \] 2. There exists a strongly summable ultrafilter \(\mathcal{U}\in\beta\mathbb{Z}\) such that \[ \sigma\mathcal{U}\models P ( x_1 ,\dots, x_m ) = 0. \] 3. \(P\) has a solution in \(\mathfrak{G}(\sigma)\), where \(\mathfrak{G}(\sigma)\) is the equivalence class of \(\sigma\) under a certain equivalence relation.
- 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
- 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
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)
