Related papers: Borel structurability by locally finite simplicial…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

We show that every basis for the countable Borel equivalence relations strictly above $\mathbb{E}_0$ under measure reducibility is uncountable, thereby ruling out natural generalizations of the Glimm-Effros dichotomy. We also push many…

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

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…

We consider the problem of determining the complexity of the uniform homeomorphism relation between separable Banach spaces in the Borel reducibility hierarchy of analytic equivalence relations. We prove that the complete $K_{\sigma}$…

We are dealing with the complexity of the homeomorphism equivalence relation on some classes of metrizable compacta from the viewpoint of invariant descriptive set theory. We prove that the homeomorphism equivalence relation of absolute…

We show that if an equivalence relation $E$ on a Polish space is a countable union of smooth Borel subequivalence relations, then there is either a Borel reduction of $E$ to a countable Borel equivalence relation on a Polish space or a…

Let $(X_n,d_n),\,n\in\Bbb N$ be a sequence of pseudo-metric spaces, $p\ge 1$. For $x,y\in\prod_{n\in\Bbb N}X_n$, let $(x,y)\in E((X_n)_{n\in\Bbb N};p)\Leftrightarrow\sum_{n\in\Bbb N}d_n(x(n),y(n))^p<+\infty$. For Borel reducibility between…

We consider a quartic O(N)-vector model. Using the Loop Vertex Expansion, we prove the Borel summability in 1/N along the real axis of the partition function and of the connected correlations of the model. The Borel summability holds…

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite then the complexity of hyperfinite countable Borel equivalence relations is as high as possible, namely,…

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

We study the lattice of all Borel clones on $2 = \{0,1\}$: classes of Borel functions $f : 2^n \to 2$, $n \le \omega$, which are closed under composition and include all projections. This is a natural extension to countable arities of…

We present a Morse-theoretic characterization of collapsibility for 2-dimensional acyclic simplicial complexes by means of the values of normalized optimal combinatorial Morse functions.

We investigate $\mathcal F$-Borel topological spaces. We focus on finding out how a~complexity of a~space depends on where the~space is embedded. Of a~particular interest is the~problem of determining whether a~complexity of given space $X$…

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

A Borel equivalence relation on a Polish space is said to be countable if all of its equivalence classes are countable. Standard examples of countable Borel equivalence relations (on the space of subsets of the integers) that occur in…

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…