LTLola Thompson

Lola Thompson

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Lola Thompson has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Sums of Proper Divisors with Missing Digits

    by Kübra Benli, Giulia Cesana, Cécile Dartyge, Charlotte Dombrowsky, Lola Thompson

  • Reviews

    by Lola Thompson

  • Open Access

    Sums of proper divisors with missing digits

    by Kübra Benli, Giulia Cesana, Cécile Dartyge, Charlotte Dombrowsky, Lola Thompson

    Let $s(n)$ denote the sum of proper divisors of an integer $n$. In 1992, Erdős, Granville, Pomerance, and Spiro (EGPS) conjectured that if $\mathcal{A}$ is a set of integers with asymptotic density zero then $s^{-1}(\mathcal{A})$ also has asymptotic density zero. In this paper we show that the EGPS conjecture holds when $\mathcal{A}$ is taken to be a set of integers with missing digits. In particular, we give a sharp upper bound for the size of this preimage set. We also provide an overview of progress towards the EGPS conjecture and survey recent work on sets of integers with missing digits.

  • Open Access

    Summing $\mu (n)$: a faster elementary algorithm

    by Harald Andrés Helfgott, Lola Thompson

    We present a new elementary algorithm that takes $$ \textrm{time} \ \ O_\epsilon \left( x^{\frac{3}{5}} (\log x)^{\frac{8}{5}+\epsilon } \right) \ \ \textrm{and} \ \textrm{space} \ \ O\left( x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right) $$ time O ϵ x 3 5 ( log x ) 8 5 + ϵ and space O x 3 10 ( log x ) 13 10 (measured bitwise) for computing $$M(x) = \sum _{n \le x} \mu (n),$$ M ( x ) = ∑ n ≤ x μ ( n ) , where $$\mu (n)$$ μ ( n ) is the Möbius function. This is the first improvement in the exponent of x for an elementary algorithm since 1985. We also show that it is possible to reduce space consumption to $$O(x^{1/5} (\log x)^{5/3})$$ O ( x 1 / 5 ( log x ) 5 / 3 ) by the use of (Helfgott in: Math Comput 89:333–350, 2020), at the cost of letting time rise to the order of $$x^{3/5} (\log x)^2 \log \log x$$ x 3 / 5 ( log x ) 2 log log x .


  • Open Access

    Summing $μ(n)$: a faster elementary algorithm

    by Harald A. Helfgott, Lola Thompson

    We present a new elementary algorithm that takes \[ \mathrm{time} \ \ O_\epsilon\left(x^{\frac{3}{5}} (\log x)^{\frac{3}{5}+\epsilon} \right) \ \ \mathrm{and}\ \ \mathrm{space} \ \ O\left(x^{\frac{3}{10}} (\log x)^{\frac{13}{10}} \right)\] for computing $M(x) = \sum_{n \leq x} \mu(n),$ where $\mu(n)$ is the M\"{o}bius function. This is the first improvement in the exponent of $x$ for an elementary algorithm since 1985. We also show that it is possible to reduce space consumption to $O(x^{1/5} (\log x)^{5/3})$ by the use of (Helfgott, 2020; arxiv.org:1712.09130), at the cost of letting time rise to the order of $x^{3/5} (\log x)$.

  • Open Access

    Counting Salem Numbers of Arithmetic Hyperbolic 3-Orbifolds

    by Mikhail Belolipetsky, Matilde Lalín, Plinio G. P. Murillo, Lola Thompson

    It is known that the lengths of closed geodesics of an arithmetic hyperbolic orbifold are related to Salem numbers. We initiate a quantitative study of this phenomenon. We show that any non-compact arithmetic 3-dimensional orbifold defines $$c Q^{1/2} + O(Q^{1/4})$$ c Q 1 / 2 + O ( Q 1 / 4 ) square-rootable Salem numbers of degree 4 which are less than or equal to Q. This quantity can be compared to the total number of such Salem numbers, which is shown to be asymptotic to $$\frac{4}{3}Q^{3/2}+O(Q)$$ 4 3 Q 3 / 2 + O ( Q ) . Assuming the gap conjecture of Marklof, we can extend these results to compact arithmetic 3-orbifolds. As an application, we obtain lower bounds for the strong exponential growth of mean multiplicities in the geodesic spectrum of non-compact even dimensional arithmetic orbifolds. Previously, such lower bounds had only been obtained in dimensions 2 and 3.


  • Open Access

    Counting Salem numbers of arithmetic hyperbolic 3-orbifolds

    by Mikhail Belolipetsky, Matilde Lalín, Plinio G. P. Murillo, Lola Thompson

    It is known that the lengths of closed geodesics of an arithmetic hyperbolic orbifold are related to Salem numbers. We initiate a quantitative study of this phenomenon. We show that any non-compact arithmetic $3$-dimensional orbifold defines $c Q^{1/2} + O(Q^{1/4})$ square-rootable Salem numbers of degree $4$ which are less than or equal to $Q$. This quantity can be compared to the total number of such Salem numbers, which is shown to be asymptotic to $\frac{4}{3}Q^{3/2}+O(Q)$. Assuming the gap conjecture of Marklof, we can extend these results to compact arithmetic $3$-orbifolds. As an application, we obtain lower bounds for the strong exponential growth of mean multiplicities in the geodesic spectrum of non-compact even dimensional arithmetic orbifolds. Previously, such lower bounds had only been obtained in dimensions $2$ and $3$.

  • Heights of Divisors of xn – 1

    by Lola Thompson

    The height of a polynomial with integer coefficients is the largest coefficient in absolute value. Many papers have been written on the subject of bounding heights of cyclotomic polynomials. One result, due to H. Maier, gives a best possible upper bound of