相关论文: On the automorphism group of the universal homogen…

We show that the countable universal omega-categorical bowtie-free graph admits generic automorphisms. Moreover, we show that this graph is not finitely homogenisable.

A homogeneous family of subsets over a given set is one with a very ``rich'' automorphism group. We prove the existence of a bi-universal element in the class of homogeneous families over a given infinite set and give an explicit…

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…

We show that the conjugacy class of every pair of automoprhisms of the random poset is meager. This answers a question of Truss; see also Kuske-Truss. EDIT. Work in progress, at the moment there is a gap in the proof of Theorem 2.

We present three examples of countable homogeneous structures (also called Fraisse limits) whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures. Our first…

We prove that given a fixed finite tree $P$, almost all trees contain $P$ as a subtree. Moreover, the inclusion can be made so that it induces an embedding of the corresponding (quantum) automorphism groups, thereby providing generic…

We prove that the group of automorphisms of the generic meet-tree expansion of an infinite non-unary free Fra\"{\i}ss\'{e} limit over a finite relational language is simple. As a prototypical case, the group of automorphism of the Rado…

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…

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.

In \cite{MbPe}, Mbombo and Pestov prove that the group of isometries of the generalized Urysohn space of density $\kappa$, for uncountable $\kappa$ such that $\kappa^{<\kappa}=\kappa$, is not a universal topological group of weight…

We prove that the automorphism group of a general complete intersection $X$ in a projective space is trivial with a few well-understood exceptions. We also prove that the automorphism group of a complete intersection $X$ acts on the…

We study the existence of universal autohomeomorphisms of $\mathbb{N}^*$. We prove that $\mathsf{CH}$ implies there is such an autohomeomorphism and show that there are none in any model where all autohomeomorphisms of $\mathbb{N}^*$ are…

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…

We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.

We show that the automorphism group of Philip Hall's universal locally finite group has ample generics,that is, it admits comeager diagonal conjugacy classes in all dimensions.Consequently, it has the small index property, is not the union…

A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.

We show that smooth well formed weighted complete intersections have finite automorphism groups, with several obvious exceptions.

We prove in most cases that a general smooth complete intersection in the projective space has no non-trivial automorphisms.

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…

Solecki proved that the group of automorphisms of a countable structure cannot be an uncountable free abelian group. See more in Just, Shelah and Thomas math.LO/0003120 where as a by product we can say something on on uncountable…