Related papers: The Classification Problem for Simple Unital Finit…
We analyze the classification problem for finitely generated orderable groups from the viewpoint of descriptive set theory. We analyze the standard Borel space of finitely generated left-orderable groups, and the subspace of finitely…
We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…
We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…
We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…
We consider the homeomorphic classification of finite-dimensional continua as well as several related equivalence relations. We show that, when $n \geq 2$, the classification problem of $n$-dimensional continua is strictly more complex than…
We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of…
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…
The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and…
We observe that the classification problem for countable models of arithmetic is Borel complete. On the other hand, the classification problems for finitely generated models of arithmetic and for recursively saturated models of arithmetic…
Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…
Given a countable o-minimal theory T, we characterize the Borel complexity of isomorphism for countable models of T up to two model-theoretic invariants. If T admits a nonsimple type, then it is shown to be Borel complete by embedding the…
A topological group G is profinite if it is compact and totally disconnected. Equivalently, G is the inverse limit of a surjective system of finite groups carrying the discrete topology. We discuss how to represent a countably based…
We give a survey of recent results related to the problem of characterizing finite-dimensional division algebras by the set of isomorphism classes of their maximal subfields. We also discuss various generalizations of this problem and some…
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.
The problem of classifying all unitary R-matrices of arbitrary finite dimension that have precisely two distinct eigenvalues is described, working up to a natural equivalence relation given by the characters of their braid group…
It is shown that the isomorphism relation between continuous t-norms is Borel bireducible with the relation of order isomorphism between linear orders on the set of natural numbers, and therefore, it is a Borel complete equivalence…
In 2020, Calderoni, Marker, Motto Ros and Shani asked what the Borel complexity of the isomorphism relation of Archimedean orders on $\mathbb{Q}^n$ is. We answer this question by proving that the isomorphism relation of Archimedean orders…
We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}^{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic…
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 propose various problems about Borel complexity of characterized subgroups of compact abelian groups, inspired by our forthcoming paper \cite{DI3}.