相关论文: More Universal Minimal Flows of Groups of Automorp…

We consider automorphism groups of some countably categorical structures and their precompact expansions. We prove that automorphism groups of omega-stable omega-categorical structures have metrizable universal minimal flows. We also study…

We study the automorphism groups of countable homogeneous directed graphs (and some additional homogeneous structures) from the point of view of topological dynamics. We determine precisely which of these automorphism groups are amenable…

It is a well-known fact, that the greatest ambit for a topological group $G$ is the Samuel compactification of $G$ with respect to the right uniformity on $G.$ We apply the original destription by Samuel from 1948 to give a simple…

Given any pair of countable groups $G$ and $H$ with $G$ infinite, we construct a minimal, free, Cantor $G$-flow $X$ so that $H$ embeds into the group of automorphisms of $X$.

We study universal minimal flows of the homeomorphism groups of generalized Wa\.zewski dendrites $W_P$, $P\subset\{3,4,\ldots,\omega\}$. If $P$ is finite, we prove that the universal minimal flow of of the homeomorphism group $H(W_P)$ is…

We establish links between countable algebraically closed graphs and the endomorphisms of the countable universal graph $R$. As a consequence we show that, for any countable graph $\Gamma$, there are uncountably many maximal subgroups of…

A $k$-uniform hypergraph $M$ is set-homogeneous if it is countable (possibly finite) and whenever two finite induced subhypergraphs $U,V$ are isomorphic there is $g\in Aut(M)$ with $U^g=V$; the hypergraph $M$ is said to be homogeneous if in…

Every topological group $G$ has up to isomorphism a unique minimal $G$-flow that maps onto every minimal $G$-flow, the universal minimal flow $M(G).$ We show that if $G$ has a compact normal subgroup $K$ that acts freely on $M(G)$ and there…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

For a finite group $G$, denote by $\alpha(G)$ the minimum number of vertices of any graph $\Gamma$ having $\text{Aut}(\Gamma)\cong G$. In this paper, we prove that $\alpha(G)\leq |G|$, with specified exceptions. The exceptions include four…

We prove that for every countable discrete group $G$, there is a $G$-flow on $\omega^*$ that has every $G$-flow of weight $\leq\! \aleph_1$ as a quotient. It follows that, under the Continuum Hypothesis, there is a universal $G$-flow of…

We apply results proved in [Li19] to the linear order expansions of non-trivial free homogeneous structures and the universal n-linear order for $n\geq 2$, and prove the simplicity of their automorphism groups.

We compute the universal minimal flow of the homeomorphism group of the Lelek fan -- a one-dimensional tree-like continuum with many symmetries.

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

We consider the topological dynamics of the automorphism group of a particular sparse graph M_1 resulting from an ab initio Hrushovski construction. We show that minimal subflows of the flow of linear orders on M_1 have all orbits meagre,…

We describe the full automorphism group of the directed reduced power graph and the undirected reduced power graph of a finite group. We compute the full automorphism groups of these graphs of several classes of finite groups. Also, we…

In 2005, Kechris, Pestov and Todorcevic provided a powerful tool to compute an invariant of topological groups known as the universal minimal flow, immediately leading to an explicit representation of this invariant in many concrete cases.…

We give new examples and describe the complete lists of all measures on the set of countable homogeneous universal graphs and $K_s$-free homogeneous universal graphs (for $s\geq 3$) that are invariant with respect to the group of all…

The problem of finding upper bounds for minimal vertex number of graphs with a given automorphism group is addressed in this article for the case of cyclic $2$-groups. We show that for any natural $n\ge 2$ there is an undirected graph…

Recall that the Rado graph is the unique countable graph that realizes all one-point extensions of its finite subgraphs. The Rado graph is well-known to be universal and homogeneous in the sense that every isomorphism between finite…