Related papers: The structure of random automorphisms of countable…

Tent and Ziegler proved that the automorphism group of the Urysohn sphere is simple and that the automorphism group of the Urysohn space is simple modulo bounded automorphisms. A key component of their proof is the definition of a…

In the first part of this paper, we propose a uniform interpretation of characteristic classes as obstructions to the reduction of the structure group and to the existence of an equivariant extension of a certain homomorphism defined a…

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

We prove that numerous negatively curved simply connected locally compact polyhedral complexes, admitting a discrete cocompact group of automorphisms, have automorphism groups which are locally compact, uncountable, non linear and virtually…

We show that the class of conditional distributions satisfying the coarsening at Random (CAR) property for discrete data has a simple and robust algorithmic description based on randomized uniform multicovers: combinatorial objects…

We provide a systematic description of the automorphism groups of specially cocompact CAT(0) cube complexes. We show that these groups are topologically finitely generated, present a method to explicitly obtain generating sets, and prove a…

In this paper we consider some classical varieties of linear algebras over the field which has characteristic 0. For every considered variety we take a category of the finite generated free algebras of this variety. And for every this…

Let $S_\infty$ denote the topological group of permutations of the natural numbers. We study the complexity of the isomorphism relation on classes of closed subgroups $S_\infty$ in the setting of Borel reducibility between equivalence…

We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.

We study criteria for the existence of a dense or comeager conjugacy class in the automorphism group of a given measure on the Cantor space. We concentrate on good measures, defined by Akin [\emph{Trans.\ Amer.\ Math.\ Soc.} \textbf{357}…

We construct homeomorphisms of compacta from relations between finite graphs representing their open covers. Applied to the pseudoarc, this yields simple Fra\"iss\'e theoretic proofs of several important results, both old and new.…

Wright showed that, if a 1-ended simply connected locally compact ANR Y with pro-monomorphic fundamental group at infinity admits a proper Z-action, then that fundamental group at infinity can be represented by an inverse sequence of…

We study uniform and non-uniform model sets in arbitrary locally compact second countable (lcsc) groups, which provide a natural generalization of uniform model sets in locally compact abelian groups as defined by Meyer and used as…

In the paper we study twisted conjugacy classes and isogredience classes for automorphisms of reductive linear algebraic groups. We show that reductive linear algebraic groups over some fields of zero characteristic possess the $R_\infty$…

The celebrated Erd\H{o}s-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much better bound than the logarithmic size that is provided by…

How rich is the collection of groups with a given prominent property? In this work we approach this question for property~$R_\infty$, which says that every automorphism $\varphi$ of a given group has infinitely many orbits under the…

We obtain a kind of structure theorem for the automorphism group ${\rm Aut}{\cal A}$ of a unital C$^{*}$-algebra ${\cal A}$. According to it, ${\rm Aut}{\cal A}$ can be regarded as a subgroup of the semi-direct product of direct product…

Two measures of how near an arbitrary function between groups is to being a homomorphism are considered. These have properties similar to conjugates and commutators. The authors show that there is a rich theory based on these structures,…

We work with a finite relational vocabulary with at least one relation symbol with arity at least 2. Fix any integer $m > 1$. For almost all finite structures (labelled or unlabelled) such that at least $m$ elements are moved by some…

We deal with the random combinatorial structures called assemblies. By weakening the logarithmic condition which assures regularity of the number of components of a given order, we extend the notion of logarithmic assemblies. Using the…