Partition regularity of polynomial systems near zero
Lorenzo Luperi Baglini

TL;DR
This paper extends the results on partition regularity of polynomial systems near zero to a broader class of systems and semigroups, using ultrafilter techniques to weaken initial assumptions.
Contribution
It generalizes previous findings by broadening the class of polynomial systems and semigroups for which partition regularity near zero holds, employing ultrafilter methods.
Findings
Extended partition regularity results to more systems
Weakened conditions on the dense subsemigroups
Utilized ultrafilter techniques for proofs
Abstract
Recently, S.~Kanti Patra and Md.~Moid Shaik proved the existence of monochromatic solutions to systems of polynomial equations near zero for particular dense subsemigroups of . We extend their results to a much larger class of systems whilst weakening the requests on , using solely basic results about ultrafilters.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Advanced Differential Equations and Dynamical Systems · Algebraic Geometry and Number Theory
