Lola Thompson
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
Research Subjects
Research Interests
Lola Thompson has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Charlotte Dombrowsky
Universiteit Leiden
2 shared publications - Cécile Dartyge
Institut Élie Cartan Université de Lorraine BP 239 54506 Vandoeuvre Cedex France
2 shared publications - Giulia Cesana
University of Cologne
2 shared publications - Harald Andrés Helfgott
Mathematisches Institut, Georg-August-Universität Göttingen, Göttingen, Germany
2 shared publications - Kübra Benli
University of Lethbridge, Department of Mathematics and Computer Science, 4401 University Drive, Lethbridge, Alberta T1K 3M4, Canada
2 shared publications - Matilde Lalín
Département de Mathématiques et de Statistique, Université de Montréal, Montréal, Canada
2 shared publications
Latest Publications
- 6 March 2024
- Published by Springer Nature
- p. 93-110
Sums of Proper Divisors with Missing Digits
- 21 December 2023
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 131 (3) , 273-276
Reviews
- 21 December 2023
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 131 (3) , 273-276
Reviews
- Open Access
Sums of proper divisors with missing digits
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 AccessSums of proper divisors with missing digits
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
- 8 December 2022
- Published by Springer Nature in Research in Number Theory
- Vol. 9 (1) , 1-37
Summing $\mu (n)$: a faster elementary algorithmWe 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) $$ (measured bitwise) for computing $$M(x) = \sum _{n \le x} \mu (n),$$ where $$\mu (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})$$ 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$$ .- 8 December 2022
- Published by Springer Nature in Research in Number Theory
- Vol. 9 (1) , 1-37
Open AccessSumming $\mu (n)$: a faster elementary algorithmWe 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) $$ (measured bitwise) for computing $$M(x) = \sum _{n \le x} \mu (n),$$ where $$\mu (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})$$ 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$$ . - Open Access
Summing $μ(n)$: a faster elementary algorithm
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 AccessSumming $μ(n)$: a faster elementary algorithm
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
- 22 July 2021
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 53 (2) , 553-569
Counting Salem Numbers of Arithmetic Hyperbolic 3-Orbifolds
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.- 22 July 2021
- Published by Springer Nature in Bulletin of the Brazilian Mathematical Society, New Series
- Vol. 53 (2) , 553-569
Open AccessCounting Salem Numbers of Arithmetic Hyperbolic 3-Orbifolds
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. - Open Access
Counting Salem numbers of arithmetic hyperbolic 3-orbifolds
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$.Open AccessCounting Salem numbers of arithmetic hyperbolic 3-orbifolds
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$. - 1 January 2011
- Published by Walter de Gruyter GmbH in Integers
- Vol. 11 (4)
Heights of Divisors of xn – 1
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
- 1 January 2011
- Published by Walter de Gruyter GmbH in Integers
- Vol. 11 (4)
Heights of Divisors of xn – 1
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