G. Caveney

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

collaborators

3 papers

math.CO2026

Repetition Avoidance in Curling-Number Transforms

Geoffrey Caveney, Haoxuan, Dong +1

We study repetition avoidance in a word $w$ and its curling-number transform $C (w)$ . For alphabets of sizes $2$ , $3$ , and $4$ , we use Thue-Morse-based morphic construct…

math.NT2011★ 1 cited

On SA, CA, and GA numbers

Geoffrey Caveney, Jean-Louis Nicolas, Jonathan Sondow

Gronwall's function $G$ is defined for $n > 1$ by $G (n) = \frac{σ ( n )}{n l o g l o g n}$ where $σ (n)$ is the sum of the divisors of $n$ . We call an integer $N > 1$ a \emph{GA1 number} if $N$ …

math.NT2011

Robin's theorem, primes, and a new elementary reformulation of the Riemann Hypothesis

Geoffrey Caveney, Jean-Louis Nicolas, Jonathan Sondow

For n>1, let G(n)=σ(n)/(n log log n), where σ(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satis…