179 citations · 759 across the 49 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020★ 9 cited
On strongly walk regular graphs, triple sum sets and their codes
Michael Kiermaier, Sascha Kurz, Patrick Solé +2
Strongly walk regular graphs (SWRGs or -SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~. They…
math.DS2020★ 1 cited
The Weierstrass root finder is not generally convergent
Bernhard Reinke, Dierk Schleicher, Michael Stoll
Finding roots of univariate polynomials is one of the fundamental tasks of numerics, and there is still a wide gap between root finders that are well understood in theory and those…