On disjoint sets

2022/08/24 by Fang, Jin-Hui, Csaba Sándor, Sándor, Csaba · 1 citation
Computer Science · Mathematics · #11B13 #11B34 #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2208.11357

openalex publication_date 2022/08/24 · openalex created_date 2022/08/27 · openalex updated_date 2026/07/28

Abstract

Two sets of nonnegative integers A=\a₁ε√(x) and B(x)>ε√(x) for some ε>0, which answered a problem posed by Erd\H os and Graham. In this paper, following Erdős and Freud's work, we explore further properties for disjoint sets. As a main result, we prove that, for disjoint sets A and B, assume that \x₁

Cited by

• PIP: Making Andersen's Points-to Analysis Sound and Practical for Incomplete C Programs

Related

• On primes amongst squares of naturals
• On function SX of additive complements
• On the integer sets with the same representation functions
• Variations on Dirichlet's theorem
• On products of disjoint blocks of arithmetic progressions and related\n equations