A group A acting faithfully on a set X is 2-distinguishable if there is a 2-coloring of X that is not preserved by any nonidentity element of A, equivalently, if there is a proper subset of X with trivial setwise stabilizer. The motion of an element a in A is the number of points of X that are moved by a, and the motion of the group A is the minimal motion of its nonidentity elements. When A is finite, the Motion Lemma says that if the motion of A is large enough (specifically at least 2 log_2 |A|), then the action is 2-distinguishable. For many situations where X has a combinatorial or algebraic structure, the Motion Lemma implies that the action of Aut(X) on X is 2-distinguishable in all but finitely many instances.\ud We prove an infinitary version of the Motion Lemma for countably infinite permutation groups, which states that infinite motion is large enough to guarantee 2-distinguishability. From this we deduce a number of results, including the fact that every locally finite, connected graph whose automorphism group is countably infinite is 2-distinguishable. One cannot extend the Motion Lemma to uncountable permutation groups, but nonetheless we prove that (under the permutation topology) every closed permutation group with infinite motion has a dense subgroup which is 2-distinguishable. We conjecture an extension of the Motion Lemma which we expect holds for a restricted class of uncountable permutation groups, and we conclude with a list of open questions. The consequences of our results are drawn for orbit equivalence of infinite permutation groups

We introduce a new product for permutation groups. It takes as input two permutation groups, M and N, and produces an infinite group M [X] N which carries many of the permutational properties of M. Under mild conditions on M and N the group M [X]N is simple.\ud \ud As a permutational product, its most significant property is the following: M [X] N is primitive if and only if M is primitive but not regular, and N is transitive. Despite this remarkable similarity with the wreath product in product action, M [X] N and M Wr N are thoroughly dissimilar.\ud \ud The product provides a general way to build exotic examples of non-discrete, simple, totally disconnected, locally compact, compactly generated topological groups from discrete groups.\ud \ud We use this to obtain the first construction of uncountably many pairwise non-isomorphic simple topological groups that are totally disconnected, locally compact, compactly generated and non-discrete. The groups we construct all contain the same compact open subgroup.\ud The analogous result for discrete groups was proved in 1953 by Ruth Camm.\ud \ud To build the product, we describe a group U(M,N) that acts on a biregular tree T. This group has a natural universal property and is a generalisation of the iconic universal group construction of Marc Burger and Shahar Mozes for locally finite regular trees

The distinguishing number of a group G acting faithfully on a set V is the least number of colors needed to color the elements of V so that no non-identity element of the group preserves the coloring. The distinguishing number of a graph is the distinguishing number of its full automorphism group acting on its vertex set. A connected graph Γ is said to have connectivity 1 if there exists a vertex α ∈ V Γ such that Γ \ {α} is not connected. For α ∈ V , an orbit of the point stabilizer Gα is called a suborbit of G.We prove that every connected primitive graph with infinite diameter and countably many vertices has distinguishing number 2. Consequently, any infinite, connected, primitive, locally finite graph is 2distinguishable; so, too, is any infinite primitive group with finite suborbits. We also show that all denumerable vertex-transitive graphs of connectivity 1 and all Cartesian products of connected denumerable graphs of infinite diameter have distinguishing number 2. All of our results follow directly from a versatile lemma which we call The Distinct Spheres Lemma.

We classify all infinite primitive permutation groups possessing a finite point stabilizer, thus extending the seminal Aschbacher-O'Nan-Scott Theorem to all primitive permutation groups with finite point stabilizers