Computability of the Julia set. Nonrecurrent critical orbits
Artem Dudko
We prove, that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits.
keywords: computational complexity Computability Julia set.
On spectra of Koopman, groupoid and quasi-regular representations
Artem Dudko Rostislav Grigorchuk

In this paper we investigate relations between Koopman, groupoid and quasi-regular representations of countable groups. We show that for an ergodic measure class preserving action of a countable group G on a standard Borel space the associated groupoid and quasi-regular representations are weakly equivalent and weakly contained in the Koopman representation. Moreover, if the action is hyperfinite then the Koopman representation is weakly equivalent to the groupoid. As a corollary of our results we obtain a continuum of pairwise disjoint pairwise equivalent irreducible representations of weakly branch groups. As an illustration we calculate spectra of regular, Koopman and groupoid representations associated to the action of the 2-group of intermediate growth constructed by the second author in 1980.

keywords: Koopman representation groupoid construction quasi-regular representation spectrum weak containment weakly branch groups

Year of publication

Related Authors

Related Keywords

[Back to Top]