Complete Sets

Theophilus Agama ()

Indian Journal of Pure and Applied Mathematics, 2020, vol. 51, issue 3, 817-824

Abstract: 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 ℌ ≔ [1, N] and letting $${\cal C}(N)$$ C ( N ) denotes the complete set counting function, we establish the lower bound $${\cal C}(N)$$ C ( N ) ≫ N log N.

Keywords: Sets; completeness; 05Axx; 11Bxx; 11Axx (search for similar items in EconPapers)
Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-020-0433-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:51:y:2020:i:3:d:10.1007_s13226-020-0433-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-020-0433-5

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().