Corpus ID: 119151174

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

  title={Counting primitive subsets and other statistics of the divisor graph of \$\\{1,2, \ldots n\\}\$},
  author={Nathan McNew},
  journal={arXiv: Number Theory},
Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(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 $\alpha$. 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… Expand
2 Citations

Tables from this paper

The number of multiplicative Sidon sets of integers
It is shown that the number of multiplicative Sidon subsets of { 1, …, n } is T ( n) ⋅ 2 Θ ( n 3 / 4 ( log ⁡ n ) 3 / 2 ) for a certain function T (n ) ≈ 2 1.815 π ( n ) which is a rare example in which the order of magnitude of the lower order term in the exponent is determined. Expand
Integrable spin, vertex and loop models
This thesis deals with several problems in statistical mechanics, related to the study of integrable models. In these models, some particular symmetries, like those expressed by the Yang-BaxterExpand


On large primitive subsets of $\{1,2,\ldots,2n\}$
A subset of $\{1,2,\ldots,2n\}$ is said to be primitive if it does not contain any pair of elements $(u,v)$ such that $u$ is a divisor of $v$. Let $D(n)$ denote the number of primitive subsets ofExpand
The number of maximum primitive sets of integers
We study problems on enumerating sets of integers with multiplicitive contraints. A subset of $\{1,\ldots,n\}$ is \emph{primitive} if it does not contain an element dividing another. Let $g(n)$ beExpand
A Cameron and Erdős Conjecture on Counting Primitive Sets
  • R. Angelo
  • Mathematics, Computer Science
  • Integers
  • 2017
It is shown that f (n) grows like the $n$-th power of some real number, in the sense that $\lim_{n\rightarrow \infty}f(n)^{1/n}$ exists. Expand
Sur Les Partitions en Chaînes du Graphe Divisoriel
An asymptotic formula is deduced for the number of paths in D(x) needed to partition the set of vertices {1, 2, ..., ⌊x⌋}. Expand
On sets of integers which contain no three terms in geometric progression
A method of constructing sets with a greater upper density than Rankin's set is demonstrated, and it is shown that geometric progressions in Z/nZ behave more like Roth's theorem in that one cannot take any fixed positive proportion of the integers modulo a sufficiently large value of n while avoiding geometric progression. Expand
XXIV.—Sets of Integers Containing not more than a Given Number of Terms in Arithmetical Progression*
Sets of integers are constructed having the property that n members are in arithmetical progression only if they are all equal; here n is any integer greater than or equal to 3. Previous results haveExpand
Multiplicative structures in additively large sets
The question of how much multiplicative structure can be found in additively large sets is investigated, and it is shown that any translate of a set of finite sums from an infinite sequence must contain all of the initial products from another infinite sequence. Expand
Introduction to Analytic and Probabilistic Number Theory
Foreword Notation Part I. Elementary Methods: Some tools from real analysis 1. Prime numbers 2. Arithmetic functions 3. Average orders 4. Sieve methods 5. Extremal orders 6. The method of van derExpand
On sequences without geometric progressions
This paper improves on Rankin's results, derive upper bounds, and looks at sequences generated by a greedy algorithm. Expand
Etude du graphe divisoriel 2
Abstract. We show that the maximum number of positive integers that appear in k non disjoint paths of the divisorial graph restricted to the numbers ⩽N, is about N log k/log N. We study also someExpand