Related papers: Polish group actions and computability
We show that, for a coanalytic subspace $X$ of $2^\omega$, the countable dense homogeneity of $X^\omega$ is equivalent to $X$ being Polish. This strengthens a result of Hru\v{s}\'ak and Zamora Avil\'es. Then, inspired by results of…
We classify all finite groups $G$ which possesses an element $x\in G$ such that every irreducible character of $G$ takes a root of unity value at $x$.
We prove that if a function $f$ is continuous in an open subset $U\subset\mathbb{C}$ and analytic in $U\setminus X$, where $X\subset U$ is a Polish space having characteristic system $(i,n)$, such that $i\in\{0,1\}$ and $n\in\mathbb{N}$,…
A Polish group is surjectively universal if it can be continuously homomorphically mapped onto every Polish group. Making use of a type of new metrics on free groups \cite{DG}, we prove the existence of surjectively universal Polish groups,…
Let F be a finite field with q elements, let A be a finite dimensional F-algebra and let J=J(A) be the Jacobson radical of A. Then G=1+J is a p-group, where p is the characteristic of F. We refer to G as an F-algebra group. A subgroup H of…
Given a space $X$ we investigate the descriptive complexity class $\G_X$ of the set $\FF_0(X)$ of all its closed zero-dimensional subsets, viewed as a subset of the hyperspace $\FF(X)$ of all closed subsets of $X$. We prove that $\max \{…
We consider space functions $s(n)$ of finitely presented groups $G =< A\mid R> .$ (These functions have a natural geometric analog.) To define $s(n)$ we start with a word $w$ over $A$ of length at most $n$ equal to 1 in $G$ and use…
We investigate the computability of the isomorphism set $\operatorname{Iso}(G_A,G_B)$ between $G_A$ and $G_B$, where $G_A$ is a subgroup of $\mathbb{Q}^n$ generated by columns of integer powers of a non-singular $n \times n$-matrix $A$ with…
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
The set of increasing functions on the rational numbers, equipped with the composition operation, naturally forms a topological semigroup with respect to the topology of pointwise convergence in which a sequence of increasing functions…
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…
Our first motivation was the question: can a countable structure have an automorphism group, which a free uncountable group? This is answered negatively in [Sh:744]. Lecturing in a conference in Rutgers, February 2001, I was asked whether I…
We analyze the effective content of countable, second countable topological spaces by directly calculating the complexity of several topologically defined index sets. We focus on the separation principles, calibrating an arithmetic…
We investigate (2,1):1 structures, which consist of a countable set $A$ together with a function $f: A \to A$ such that for every element $x$ in $A$, $f$ maps either exactly one element or exactly two elements of $A$ to $x$. These…
We show that if $G$ is a non-archimedean, Roelcke precompact, Polish group, then $G$ has Kazhdan's property (T). Moreover, if $G$ has a smallest open subgroup of finite index, then $G$ has a finite Kazhdan set. Examples of such $G$ include…
The absolute Galois group Gal$(\overline{\mathbb{Q}}/\mathbb{Q})$ of the field $\mathbb{Q}$ of rational numbers can be presented as a highly computable object, under the notion of type-2 Turing computation. We formalize such a presentation…
For every countable group G we construct a compact path connected subspace K of R^4 whose fundamental group is isomorphic to G. Our construction is much simpler than the one found recently by Virk.
Following a similar result of Uspenskij on the unitary group of a separable Hilbert space we show that with respect to the lower (or Roelcke) uniform structure the Polish group $G= \Aut(\mu)$, of automorphisms of an atomless standard Borel…
Motivated by the notion of strong computable type for sets in computable analysis, we define the notion of strong computable type for $G$-shifts, where $G$ is a finitely generated group with decidable word problem. A $G$-shift has strong…
We show some basic results on the characterization of quasi-Polish spaces in terms of spaces of ideals, with an emphasis on the connections with computable topology.