Complete sets

DOI10.1007/S13226-020-0433-5zbMATH Open1471.11104arXiv1802.05124OpenAlexW2795630193MaRDI QIDQ2221060FDOQ2221060

Authors: Theophilus Agama 

Publication date: 26 January 2021

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

Abstract: In this paper we introduce the concept of completeness of sets. We study this property on the set of integers. We examine how this property is preserved as we carry out various operations compatible with sets. We also introduce the problem of counting the number of complete subsets of any given set. That is, given any interval of integers $mathcalH:=[1,N]$ and letting $mathcalC(N)$ denotes the complete set counting function, we establish the lower bound $mathcalC(N)ggNlogN$.

Full work available at URL: https://arxiv.org/abs/1802.05124

Recommendations

• New examples of complete sets, with connections to a Diophantine theorem of Furstenberg
• A note on additive complements
• On complete subsets of the cyclic group
• On finite additive complements
• Complete sets and surroundings

zbMATH Keywords

setscompleteness

Mathematics Subject Classification ID

Other combinatorial number theory (11B75)

Cites Work

• Elementary Methods in Number Theory
• Labyrinth of thought. A history of set theory and its role in modern mathematics.

Cited In (1)

• Some general theorems about a class of sets of numbers

This page was built for publication: Complete sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221060)