T. Fink

activity

20122020

most citedFermi polaron-polaritons in charge-tunable atomically thin semiconductors

605 citations · 1.1k across the 11 of their papers we have counts for

collaborators

Showing math.NTShow all

2 papers · 1 filter

math.NT2020

Recursively abundant and recursively perfect numbers

Thomas Fink

The divisor function $σ (n)$ sums the divisors of $n$ . We call $n$ abundant when $σ (n) - n > n$ and perfect when $σ (n) - n = n$ . I recently introduced the recursive divisor function…

math.NT2019

Recursively divisible numbers

Thomas Fink

We introduce and study the recursive divisor function, a recursive analog of the usual divisor function: $κ_{x} (n) = n^{x} + \sum_{d ⌊ n} κ_{x} (d)$ , where the sum is over the proper…