Related papers: The complexity of isomorphism between countably ba…

We give strong necessary conditions on the admissibility of a Polish group topology for an arbitrary graph product of groups $G(\Gamma, G_a)$, and use them to give a characterization modulo a finite set of nodes. As a corollary, we give a…

We show that finite (i.e. locally finite and decomposition-finite) objects of a connected Grothendieck topos span a Boolean pretopos with an essentially unique Galois point. The automorphism group of this point carries a profinite topology…

Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…

Let $G$ be a Polish group and let $H \leq G$ be a compact subgroup. We prove that there exists a Borel set $T \subset G$ which is simultaneously a complete set of coset representatives of left and right cosets, provided that a certain index…

Profinite congruences on profinite algebras determining profinite quotients are difficult to describe. In particular, no constructive description is known of the least profinite congruence containing a given binary relation on the algebra.…

An $integral$ of a group $G$ is a group $H$ whose commutator subgroup is isomorphic to $G$. This paper continues the investigation on integrals of groups started in the work arXiv:1803.10179. We study: (1) A sufficient condition for a bound…

A subspace Y of a separable metrizable space X is separable, but without X metrizable this is not true even If Y is a closed linear subspace of a topological vector space X. K.H. Hofmann and S.A. Morris introduced the class of pro-Lie…

A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the…

Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…

We study from the perspective of Borel complexity theory the classification problem for multiplier algebras associated with operator algebraic varieties. These algebras are precisely the multiplier algebras of irreducible complete…

Let $\overline G$ be the wonderful compactification of a simple affine algebraic group $G$ defined over $\mathbb C$ such that its center is trivial and $G\not= {\rm PSL}(2,\mathbb{C})$. Take a maximal torus $T \subset G$, and denote by…

For every countable structure $M$ we construct an $\aleph_0$-stable countable structure $N$ such that $Aut(M)$ and $Aut(N)$ are topologically isomorphic. This shows that it is impossible to detect any form of stability of a countable…

These notes expand upon our lectures on {\em profinite rigidity} at the international colloquium on randomness, geometry and dynamics, organised by TIFR Mumbai at IISER Pune in January 2024. We are interested in the extent to which groups…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

Let $p$ be a branched covering of a Riemann surface to the Riemann sphere $\mathbb{P}^1$, with branching set $B \subset \mathbb{P}^1$. We define the complexity of $p$ as infinity, if $\mathbb{P}^1 \setminus B$ does not admit a hyperbolic…

We show that the topology of uniform convergence on bounded sets is compatible with the group law of the automorphism group of a large class of spaces that are endowed with both a uniform structure and a bornology, thus yielding numerous…

We locate the complexity of the set of closed sets of uniqueness U(G), for G locally compact Lie group and of the set of closed sets of extended uniqueness U_0(G), for G connected abelian Lie group. More concretely, we prove that with…

Subgraph counting is a fundamental and well-studied problem whose computational complexity is well understood. Quite surprisingly, the hypergraph version of subgraph counting has been almost ignored. In this work, we address this gap by…

We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…

We consider the oriented graph whose vertices are isomorphism classes of finitely generated groups, with an edge from G to H if, for some generating set T in H and some sequence of generating sets S_i in G, the marked balls of radius i in…