scientific article; zbMATH DE number 1134690
A sequence \(a_1<a_2<\dots <a_k\) \((=A_k)\) is said to be a \(B_h\)-sequence provided that the sums \(a_{i_1}+\dots+a_{i_h}\), \(1\leq i_1\leq i_2\leq\dots\leq i_h\leq k\) are all different. The authors investigate the sets \[ h A_k=\left\{\sum\limits^k_{i=1}x_i a_i: x_i\in N_0, \sum\limits^k_{i=1}x_i =h\right\}. \] Denote by \(B_h\) the class of all \(B_h\)-sequences. Put \(I_h(A_k)=[\ell_k ,m_k]\leq h A_k\), \(I_h(A_k)\) being the largest interval of integers contained in \(h A_k\). Put \(S_h(A_k)=m_k-\ell_k\) and define \(S_h(k)=\max S_h(A_k)\) for \(h\geq 2\). The authors show that \(A_k\in B_h\) and \[ S_h(k+2)\geq S_h(k)+1. \]
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382149)