On the density of primitive sets (Q1764002): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jnt.2004.07.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068465902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integers having exactly \(k\) prime factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distribution function of additive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On An Extremal Problem Concerning Primitive Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3358774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2785586 / rank
 
Normal rank

Revision as of 17:36, 7 June 2024

scientific article
Language Label Description Also known as
English
On the density of primitive sets
scientific article

    Statements

    On the density of primitive sets (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2005
    0 references
    A set of positive integers \(\mathcal A\) is said to be primitive if no element of \(\mathcal A\) divides any other element of \(\mathcal A\). Investigations of primitive sets center around questions about their densities with respect to various weighting functions \(f\). More precisely, given a nonnegative arithmetic function \(f\) the \(f\)-density of \(\mathcal A\) at \(N\) is defined by \(\delta(f,\mathcal A,N)=\sum_{a\leq N,\;a\in\mathcal A} f(a) \big/\sum_{n\leq N}f(n)\). Thus, for example, the upper asymptotic density of \(\mathcal A\) is given by \(\limsup_{N\to\infty}\delta(f,\mathcal A,N)\), with \(f\) identically 1, while the lower logarithmic density of \(\mathcal A\) is given by \(\liminf_{N\to\infty}\delta(f,\mathcal A,N)\), with \(f(n)=1/n\). These two choices of the weighting function \(f\) together with the third choice, \(f(n)=1/(n\log n)\), have been the subject of a number of investigations [see, for example, \textit{H. Halberstam} and \textit{K. F. Roth}, Sequences. Berlin: Springer (1983; Zbl 0498.10001)]. In this paper the authors investigate \(\delta(f,\mathcal A,N)\), and especially \(F(f,N)=\max_{\mathcal A}\delta(f,\mathcal A,N)\), for several families of weighting functions \(f\). One such family is given by \(f_\sigma(n)=n^{-\sigma}\), with \(0\leq\sigma<\infty\). In this case the order of magnitude of \(F(f_\sigma,N)\) is determined as follows: \(F(f_\sigma,N)\asymp1\), for \(0\leq\sigma\leq9/10\) and \(\sigma\geq11/10\); \(F(f_\sigma,N)\asymp(\log\log N)^{-1/2}\), for \(| \sigma-1| \leq3/\log N\); and \(F(f_\sigma,N)\asymp(\log1/| \sigma-1| )^{-1/2}\), for \(\sigma\) in the remaining range. More generally, the authors consider arbitrary nonnegative multiplicative functions \(f\), as well as \textit{smooth} weights \(f\) which are defined by the conditions: \(0\leq f(n)\leq1\) and, for some \(n_0\), we have \(f(n_0)>0\) and \(f(n)\leq f(n-1)\) for \(n>n_0\). For these general families of weighting functions \(f\) a number of results are obtained of which we state two: If \(f\) is a smooth weighting and \(\varepsilon>0\), then for all \(N\geq N_0(\varepsilon,f)\) there is a primitive set \(\mathcal A\) such that \(\delta(f,\mathcal A,N)>(1-\varepsilon)/\log\log N\). For every integer \(N\) there is a multiplicative weighting \(f\) satisfying \(f(p)=0\) or 1 and \(f(p^\nu)=0\) for \(\nu\geq2\), such that \(F(f,N)\ll(\log\log N/\log N)^{1/2}\). Moreover, it is conjectured that both of these results are optimal in the sense that in the first case \((1-\varepsilon)\) may not be replaced by \((1+\varepsilon)\) and in the second case \((\log\log N/\log N)^{1/2}\) is the correct order of magnitude of \(F(f,N)\).
    0 references
    primitive sets
    0 references
    density
    0 references

    Identifiers