2 citations · 2 across the 3 of their papers we have counts for
3 papers
math.NT2020
On the monotonicity of additive representation functions
Pascal Stumpf
We study the monotonicity behavior of three slightly differently defined additive representation functions (as initiated by Erdős, Sárközy and Sós), answering one open question and…
math.CO2017
A Descent on Simple Graphs -- from Complete to Cycle -- and Algebraic Properties of Their Spectra
Katja Mönius, Jörn Steuding, Pascal Stumpf
We investigate a descent on simple graphs, starting with the complete graph on vertices and ending up with the cycle graph by removing one edge after another. We obtain quantit…
math.NT2014★ 2 cited
A short note on reduced residues
Pascal Stumpf
We solve a problem due to Recamán about the lower bound behavior of the maximum possible length among all arithmetic progressions in the least reduced residue system modulo , as…