Rupert Hölzl

collaborators

3 papers

math.NT2025

Improved lower bounds for strong $n$ -conjectures

Rupert HÃ¶lzl, SÃ¶ren Kleine, Frank Stephan

The well-known $ab c$ -conjecture concerns triples $(a, b, c)$ of non-zero integers that are coprime and satisfy $a + b + c = 0$ . The strong $n$ -conjecture is a generalisation to $n$ summa…

math.LO2024

Randomness versus superspeedability

Rupert HÃ¶lzl, Philip Janicki, Wolfgang Merkle +1

Speedable numbers are real numbers which are algorithmically approximable from below and whose approximations can be accelerated nonuniformly. We begin this article by answering a…

math.LO2024

Benign approximations and non-speedability

Rupert HÃ¶lzl, Philip Janicki

A left-computable number $x$ is called regainingly approximable if there is a computable increasing sequence $(x_{n})_{n}$ of rational numbers converging to $x$ such that $x - x_n < 2^…

Improved lower bounds for strong n-conjectures

Randomness versus superspeedability

Benign approximations and non-speedability

Improved lower bounds for strong $n$ -conjectures