activity
20242026
most citedPrimitive sets and von Mangoldt chains: Erdős Problem #1196 and beyond

1 citations · 1 across the 2 of their papers we have counts for

collaborators

6 papers

math.NT2026

Bounds on the exceptional set in the conjecture

Christian Bernert, Tim Browning, Jared Duker Lichtman +1

We study solutions to the equation , where form a triple of coprime natural numbers. The conjecture asserts that, for any , such triples satisfy $\mathrm…

math.NT20261 cited

Primitive sets and von Mangoldt chains: Erdős Problem #1196 and beyond

Boris Alexeev, Kevin Barreto, Yanyang Li +5

A set of integers is primitive if no number in the set divides another. We introduce a new method for bounding Erdős sums of primitive sets, suggested from output of GPT-5.4 Pro,…

math.NT2025

The Bombieri-Pila determinant method

Thomas F. Bloom, Jared Duker Lichtman

We give a concise and accessible introduction to the real-analytic determinant method for counting integral points on algebraic curves, based on the classic 1989 paper of Bombieri…

math.NT2025

The conjecture is true almost always

Jared Duker Lichtman

Let denote the product of distinct prime factors of an integer . The celebrated conjecture asks whether every solution to the equation in trip…

math.NT2025

Erdős's integer dilation approximation problem and GCD graphs

Dimitris Koukoulopoulos, Youness Lamzouri, Jared Duker Lichtman

Let be a countable set such that . We prove that, for…

math.NT2024

A proof of the Erdős primitive set conjecture

Jared Duker Lichtman

A set of integers greater than 1 is primitive if no member in the set divides another. Erdős proved in 1935 that the series is uniformly bounded…