Frank Stephan

collaborators

4 papers

cs.DS2026

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions

Sanjay Jain, Junqiang Peng, Frank Stephan +2

Parity-SAT is the problem of determining whether a given CNF formula has an odd number of satisfying assignments. As a canonical $\oplus$ P-complete problem, it represents a fundame…

math.NT2025

Strong $n$ -conjectures over rings of integers

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

We study diophantine equations of the form $a_{1} + \dots + a_{n} = 0$ where the $a_{i}$ 's are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the…

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.LO2025

Independence and Induction in Reverse Mathematics

David Belanger, Chi Tat Chong, Rupert HÃ¶lzl +1

We continue the project of the study of reverse mathematics principles inspired by cardinal invariants. In this article in particular we focus on principles encapsulating the exist…

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions

Strong n-conjectures over rings of integers

Improved lower bounds for strong n-conjectures

Independence and Induction in Reverse Mathematics

Strong $n$ -conjectures over rings of integers

Improved lower bounds for strong $n$ -conjectures