2022/01/31 by Sayan Goswami, Goswami, Sayan
Computer Science · Mathematics · #Advanced Topology and Set Theory #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Mathematics #Mathematical Dynamics and Fractals
paper · pdf · doi:10.48550/arxiv.2202.01070
openalex publication_date 2022/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Erdős-Ginzburg-Ziv theorem says that if there are 2n-1 number is given, then there are n numbers such that their sum is divided by n. We will connect this theorem with the Ramsey theoretic large sets and will prove an infinitary version of this theorem. In our proof we will use the methods of ultrafilters. But one may proceed using methods of Topological dynamics.