Representing integers as sums or differences of general power products (Q2250852)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Representing integers as sums or differences of general power products
scientific article

    Statements

    Representing integers as sums or differences of general power products (English)
    0 references
    0 references
    21 July 2014
    0 references
    Let \(a_1,\ldots,a_{\ell}\) be distinct positive integers and put \(A=\{a_1,\ldots,a_{\ell}\}\). Let \(A'\) be the multiplicative semigroup generated by \(A\); that is, \[ A'=\{a_1^{m_1} a_2^{m_2}\cdots a_{\ell}^{m_{\ell}}:m_1,\ldots,m_{\ell}\;{\text{non-negative integers}}\}. \] Put \(A'_{\pm}=A'\cup (-A')\). Let \(F(k)\) the smallest natural number which cannot be represented as a sum of less than \(k\) terms from \(A'\) and \(F_{\pm }(k)\) be defined similarly where \(A'\) is replaced by \(A'_{\pm 1}\). Upper and lower bounds for \(F(k)\) and \(F_{\pm}(k)\) have been given by \textit{L. Hajdu} and \textit{R. Tijdeman} [Arch. Math. 98, 527--533 (2012; Zbl 1258.11055)] when \(a_1, \ldots, a_{\ell}\) are primes. In the paper under review, the author addresses the general case when \(a_1,\ldots,a_{\ell}\) are distinct positive integers. He recovers the results of Hajdu and Tijdeman under the assumption that \(A'\) contains two multiplicatively independent elements. In case all elements of \(A'\) are multiplicatively dependent, then he shows that \(F(k)\) and \(F_{\pm }(k)\) are much smaller for large \(k\) (there are exponential in \(k\)). A key ingredient is a generalization of a classical theorem of Tijdeman concerning gaps of elements in \(A'\) when \(a_1,\ldots,a_{\ell}\) are primes to the general situation.
    0 references
    0 references
    0 references
    representation of integers
    0 references
    linear combination
    0 references
    power
    0 references
    0 references