Related papers: Connected Polish groups with ample generics

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

An uncountable $\aleph_1$-free group cannot admit a Polish group topology but an uncountable $\aleph_1$-free abelian group can, as witnessed, for example, by the Baer-Specker group $\mathbb{Z}^\omega$; more strongly, $\mathbb{Z}^\omega$ is…

If G is a Polish group, then there is a Polish G-space X which is universal among Polish G-spaces with respect to continuous G-embeddings.

We study groups that can be defined as Polish, pro-countable groups, as non-archimedean groups with an invariant metric or as quasi-countable groups, i.e., closed subdirect products of countable, discrete groups, endowed with the product…

We study topological groups that can be defined as Polish, pro-countable abelian groups, as non-archimedean abelian groups or as quasi-countable abelian groups, i.e., Polish subdirect products of countable, discrete groups, endowed with the…

We investigate some properties of topological groups related to disconnectedness or Archimedeanness. We prove or disprove the preservation of those under operations as subgroups, quotients, products, etc. Characterizations of…

We study topological properties of conjugacy classes in Polish groups, with emphasis on automorphism groups of homogeneous countable structures. We first consider the existence of dense conjugacy classes (the topological Rokhlin property).…

We obtain an infinite family of orthogonal hypergeometric groups, which are higher rank arithmetic groups. We also list cases of arithmetic hypergeometric groups whose real Zariski closure is O(2,3).

We prove that the epimorphism relation is a complete analytic quasi-order on the space of countable groups. In the process, we obtain the result of independent interest that the epimorphism relation on pointed reflexive graphs is complete.

We show that all non-trivial continuous endomorphisms of the circle group are topologically mixing. We also show that there exists a large infinite class of continuous endomorphisms of any n-dimensional torus group which are topologically…

We show that some derived $\mathrm{L}^1$ full groups provide examples of non simple Polish groups with the topological bounded normal generation property. In particular, it follows that there are Polish groups with the topological bounded…

We show that every definable group G in an o-minimal structure is definably finitely generated. That is, G contains a finite subset that is not included in any proper definable subgroup. This provides another proof, and a generalization to…

Given a locally compact Polish space X, a necessary and sufficient condition for a group G of homeomorphisms of X to be the full isometry group of (X,d) for some proper metric d on X is given. It is shown that every locally compact Polish…

We answer some questions from a paper of Krupi\'nski by giving suitable examples of small Polish structures. First, we present a class of small Polish group structures without generic elements. Next, we construct a first example of a small…

For each ordinal $\alpha<\omega_1$, we introduce the class of $\alpha$-balanced Polish groups. These classes form a hierarchy that completely stratifies the space between the class of Polish groups admitting a two-side-invariant metric…

We prove that every finitely presentable group G arises as the fundamental group of an orientable 3-complex obtained from a hyperbolic link complement, by coning each boundary torus of the link exterior to a distinct point. We define the…

We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a…

Let $G$ be a finite group. A number of graphs with the vertex set $G$ have been studied, including the power graph, enhanced power graph, and commuting graph. These graphs form a hierarchy under the inclusion of edge sets, and it is useful…

We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…

An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…