Multiplicative bases and an Erdős problem (Q1715076)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Multiplicative bases and an Erdős problem |
scientific article |
Statements
Multiplicative bases and an Erdős problem (English)
0 references
1 February 2019
0 references
Let \([n]\) denote the set \(\{1,2,\cdots,n\}\) and \(A(n)=A\cap[n]\) for \(n\in \mathbb{N}\) and \(A\subseteq\mathbb{Z}^{+}\). Let \(\text{MB}_h(S)\) denote the set of multiplicative bases of order \(h\) of \(S\), where \(h\geq 2\) and \(S\subset \mathbb{Z}^{+}\). Let \(G_h(n)\) denote the smallest possible size of basis in \(\text{MB}_h([n])\). \textit{T. H. Chan} [Eur. J. Comb. 32, No. 3, 443--447 (2011; Zbl 1230.11025)] proved that there exists some \(c_1>0\) such that for every \(h\geq 2\) we have \[ G_h(n)\leq \pi(n)+c_1(h+1)^2 \frac{n^{(\frac{2}{h+1})}}{\log^2n}. \] In this paper the order of magnitude of \(G_h(n)- \pi(n)\) has been determined in the sense that \(h\) is not fixed, the only restriction is that \(n\) has to be large enough compared to \(h\). \textit{D. Raikov} [Rec. Math. Moscou, n. Ser. 3, 569--576 (1938; Zbl 0019.39310)] proved that a \(B \in \text{MB}_h(\mathbb{Z}^{+})\) must be dense sometimes. Here, limit superior has been determined for multiplicative bases of order \(h\) upto a constant factor not depending on \(h\). It is also shown that a set \(B \in \text{MB}_h(\mathbb{Z}^{+})\) may be thin. A set $A\subset S$ possesses property $\mathcal{P}_h$ if there are no distinct elements \(a,a_1,\ldots, a_h \in A\) with \(a\) dividing the product \(a_1\cdots a_h\). \textit{P. Erdős} [Mitt. Forsch.-Inst. Math. Mech. Univ. Tomsk 2, 74--82 (1938; Zbl 0020.00504)] studied another class of sets $\mathcal{P}_h$ related to multiplicative bases. A set \(A \in S\) possesses property $\mathcal{P}_h$ if there are distinct elements $a, a_1, \ldots, a_h\in A\) with \(a\) dividing the product \(a_1\cdots a_h\). Denote the set of these \(A\)'s by $\mathcal{P}_h(S)\). Let \(\displaystyle F_h(n)=\max_{A\in \mathcal{P}_h([n])}\vert A\vert\). \textit{P. Erdős} settled the case for \(h=2\). \textit{T. H. Chan} et al. [Eur. J. Comb. 31, No. 1, 260--269 (2010; Zbl 1255.11008)] studied the case \(h=3\). In this paper, a better estimate for $F_h(n)$ has been obtained. It is also shown that a sequence \(A \in \mathcal{P}_h(\mathbb{Z}^{+})\) must be thin sometimes, but it may be as dense as allowed by the obtained upper bound in the finite case. Finally some open problems have been presented.
0 references
density of a multiplicative basis
0 references
Erdős problem
0 references