To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge-org.demo.remotlog.com
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We study mixed identities for oligomorphic automorphism groups of countable relational structures. Our main result gives sufficient conditions for such a group to not admit a mixed identity without particular constants. We study numerous examples and prove in many cases that there cannot be a non-singular mixed identity.
Improving and clarifying a construction of Horowitz and Shelah, we show how to construct (in $\mathsf {ZF}$, i.e., without using the Axiom of Choice) maximal cofinitary groups. Among the groups we construct, one is definable by a formula in second-order arithmetic with only a few natural number quantifiers.
We construct a sofic approximation of ${\mathbb F}_2\times {\mathbb F}_2$ that is not essentially a ‘branched cover’ of a sofic approximation by homomorphisms. This answers a question of L. Bowen.
Let $S={\mathop{\rm Sym}(\Omega)$ be the group of all permutations of an infinite set $\Omega$. Extending an argument of Macpherson and Neumann, it is shown that if $U$ is a generating set for $S$ as a group, then there exists a positive integer $n$ such that every element of $S$ may be written as a group word of length at most $n$ in the elements of $U$. Likewise, if $U$ is a generating set for $S$ as a monoid, then there exists a positive integer $n$ such that every element of $S$ may be written as a monoid word of length at most $n$ in the elements of $U$. Some related questions and recent results are noted, and a brief proof is given of a result of Ore's on commutators, which is used in the proof of the above result.
A proof is given that a permutation group in which different finite sets have different stabilizers cannot satisfy any group law. For locally compact topological groups with this property, almost all finite subsets of the group are shown to generate free subgroups. Consequences of these theorems are derived for: Thompson's group $F$, weakly branch groups, automorphism groups of regular trees, and profinite groups with alternating composition factors of unbounded degree.
Willis's structure theory of totally disconnected locally compact groups is investigated in the context of permutation actions. This leads to new interpretations of the basic concepts in the theory and also to new proofs of the fundamental theorems and to several new results. The treatment of Willis's theory is self-contained and full proofs are given of all the fundamental results.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.