most citedAmenability of Bounded Automata Groups on Infinite Alphabets

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

math.DS2022

Iterated Monodromy Groups of Entire Maps and Dendroid Automata

Bernhard Reinke

This paper discusses iterated monodromy groups for transcendental functions. We show that for every post-singularly finite entire transcendental function, the iterated monodromy ac…

math.DS2022

Parametric linearization of skew products

Pierre Berger, Bernhard Reinke

We establish a linearization criterion for skew products of contractions in any dimension. We prove their smooth or holomorphic parameter dependence. In the smooth setting, we use…

math.DS2020

Diverging orbits for the Ehrlich-Aberth and the Weierstrass root finders

Bernhard Reinke

We show that the higher dimensional Weierstrass and Ehrlich-Aberth methods for finding roots of polynomials have infinite orbits that diverge to infinity. This is possible for the…

math.DS2020

Iterated Monodromy Groups of Exponential Maps

Bernhard Reinke

This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These gro…

math.GR20201 cited

Amenability of Bounded Automata Groups on Infinite Alphabets

Bernhard Reinke

We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups…

math.DS20201 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…