Counting primitive subsets and other statistics of the divisor graph of {1,2,…n}\{1,2, \ldots n\}

preprint2020arXivOpen access

Abstract

Let Q(n)Q(n) denote the count of the primitive subsets of the integers {1,2…n}\{1,2\ldots n\}. We give a new proof that Q(n)=α(1+o(1))nQ(n) = α^{(1+o(1))n} which allows us to give a good error term and to improve upon the lower bound for the value of this constant αα. We also show that the method developed can be applied to many similar problems that can be stated in terms of the divisor graph, including other questions about primitive sets, geometric-progression-free sets, and the divisor graph path-cover problem.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.