9 O ct 2 00 8 MOST ACTIONS ON REGULAR TREES ARE ALMOST FREE
نویسنده
چکیده
Let T be a d-regular tree (d ≥ 3) and A = Aut(T ) its automorphism group. Let Γ be the group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of Γ has finitely many fixed points on T .
منابع مشابه
A ] 1 3 O ct 2 00 5 COHERENT UNIT ACTIONS ON REGULAR OPERADS AND HOPF ALGEBRAS
Abstract. J.-L. Loday introduced the concept of coherent unit actions on a regular operad and showed that such actions give Hopf algebra structures on the free algebras. Hopf algebras obtained this way include the Hopf algebras of shuffles, quasi-shuffles and planar rooted trees. We characterize coherent unit actions on binary quadratic regular operads in terms of linear equations of the genera...
متن کاملar X iv : 0 70 9 . 01 76 v 2 [ m at h . D G ] 1 1 O ct 2 00 7 REPRESENTATIONS OF ORBIFOLD GROUPOIDS
Orbifold groupoids have been recently widely used to represent both effective and ineffective orbifolds. We show that every orbifold group-oid can be faithfully represented on a continuous family of finite dimensional Hilbert spaces. As a consequence we obtain the result that every orbifold groupoid is Morita equivalent to the translation groupoid of an almost free action of a proper bundle of ...
متن کامل. R A ] 8 O ct 2 00 4 BRANCH RINGS , THINNED RINGS , TREE ENVELOPING RINGS
We develop the theory of “branch algebras”, which are infinitedimensional associative algebras that are isomorphic, up to taking subrings of finite codimension, to a matrix ring over themselves. The main examples come from groups acting on trees. In particular, we construct an algebra over the field of two elements, that is finitely generated, prime, infinite-dimensional but with all proper quo...
متن کاملO ct 2 00 4 BRANCHING PROCESSES , AND RANDOM - CLUSTER MEASURES ON TREES
Random-cluster measures on infinite regular trees are studied in conjunction with a general type of ‘boundary condition’, namely an equivalence relation on the set of infinite paths of the tree. The uniqueness and non-uniqueness of randomcluster measures are explored for certain classes of equivalence relations. In proving uniqueness, the following problem concerning branching processes is enco...
متن کاملTR - 2011 - 007 Tree - minimal graphs are almost regular
For all fixed trees T and any graph G we derive a counting formula for the number N̂T (G) of homomorphisms from T to G in terms of the degree sequence of G. As a consequence we obtain that any n-vertex graph G with edge density p = p(n) n−1/(t−2), which contains at most (1 + o(1))pt−1nt copies of some fixed tree T with t ≥ 3 vertices must be almost regular, i.e., ∑ v∈V (G) |deg(v)− pn| = o(pn ).
متن کامل