Given a transitive permutation group, a fundamental object for studying its higher transitivity properties is the permutation action of its isotropy subgroup. We reverse this relationship and introduce a universal construction of infinite permutation groups that takes as input a given system of imprimitivity for its isotropy subgroup.This produces vast families of kaleidoscopic groups. We investigate their algebraic properties, such as simplicity and oligomorphy; their homological properties, such as acyclicity or contrariwise large Schur multipliers; their topological properties, such as unique polishability.Our construction is carried out within the framework of homeomorphism groups of topological dendrites.Date: January 2018. B.D. is supported in part by French projects ANR-14-CE25-0004 GAMME and ANR-16-CE40-0022-01 AGIRA. 1 Under the product topology, [n] D n is a Polish space, since D n is countable. The set of colorings C ⊆ [n] D n is easily verified to be a G δ set, so that it is a Polish space under the subspace topology; see for instance [16, Thm. 3.11]. When [n] is finite, C is in fact closed. Definition 3.2. A coloring of D n is kaleidoscopic if for all distinct x, y ∈ Br(D n ) and all distinct i, j ∈ [n], there is z ∈ (x, y) ∩ Br(D n ) such that c z (x) = i and c z (y) = j.In the following picture, open alcoves depict the two components U z (x) and U z (y) respectively colored with i and j.