The counting version of a problem of Erdős (Q2225400): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Cameron and Erd\"os conjecture on counting primitive sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Subsets of Integers with No<i>k</i>-Term Arithmetic Progression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of maximal sum-free subsets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp bound on the number of maximal sum-free subsets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3470561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of integers, none of which divides the product of \(k\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of Erdős on integers, none of which divides the product of \(k\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of<i>B<sub>h</sub></i>-Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Bh‐sets of a given cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CAMERON–ERDOS CONJECTURE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of multiplicative Sidon sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative bases and an Erdős problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph containers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of large sum-free sets of integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonisomorphic Steiner triple systems / rank
 
Normal rank

Latest revision as of 12:25, 24 July 2024

scientific article
Language Label Description Also known as
English
The counting version of a problem of Erdős
scientific article

    Statements

    The counting version of a problem of Erdős (English)
    0 references
    0 references
    0 references
    8 February 2021
    0 references
    Let the function \(\pi(n)\) denote the number of primes up to \(n\). For a positive integer \(h\), a set of positive integers \(A\) is said to have to property \(\mathcal{P}_h\), if for distinct \(a_0,a_1,a_2,\ldots,a_h\) elements of \(A\), the product \(a_1a_2\cdots a_h\) is never a multiple of \(a_0\). \textit{P. Erdős} [Mitt. Forsch.-Inst. Math. Mech. Univ. Tomsk 2, 74--82 (1938; Zbl 0020.00504)] determined the the maximum of \(|A|\) for \(A\subseteq \{1,2,\ldots,n\}\) with property \(\mathcal{P}_2\) as \(\pi(n)+ \Theta( \frac{n^{2/3}}{(\log n)^2})\). Analogous results have been obtained for the \(\mathcal{P}_h\). The paper under review investigates function \(H_h(n)\), which counts the sets \(A\subseteq \{1,2,\ldots,n\}\) with property \(\mathcal{P}_h\). With a function \(T(n)\) defined explicitly in terms of the sequence primes, \(H_2(n)=T_n \exp(\theta(\frac{n^{2/3}}{(\log n)^2}))\), and for \(h\geq 3\),\( H_h(n)=T_n \exp(\sqrt{n} \pm \Theta(\sqrt{n} \log \log n/\log n)).\)
    0 references
    problem of Erdős on integers
    0 references
    multiplicative basis
    0 references
    enumeration of primitive sets
    0 references
    enumeration of multiplicative Sidon sets
    0 references

    Identifiers