Related papers: Borel graphable equivalence relations
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…
In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…
We study a metric on the set of finite graphs in which two graphs are considered to be similar if they have similar bounded dimensional "factors". We show that limits of convergent graph sequences in this metric can be represented by…
We prove that for every Borel equivalence relation $E$, either $E$ is Borel reducible to $\mathbb{E}\_0$, or the family of Borel equivalence relations incompatible with $E$ has cofinal essential complexity. It follows that if $F$ is a Borel…
We introduce a new type of examples of bounded degree acyclic Borel graphs and study their combinatorial properties in the context of descriptive combinatorics, using a generalization of the determinacy method of Marks. The motivation for…
Answering one of the main questions of [FHK14, Chapter 7], we show that there is a tight connection between the depth of a classifiable shallow theory $T$ and the Borel rank of the isomorphism relation $\cong^\kappa_T$ on its models of size…
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 improve the known results about the complexity of the relation of isomorphism between separable Banach spaces up to Borel reducibility, and we achieve this using the classical spaces $c_0$, $\ell_p$ and $L_p$, $1 \leq p <2$. More…
We consider the class of {\em separable} $k$-hypergraphs, which can be viewed as uniform analogs of threshold Boolean functions, and the class of {\em equatable} $k$-hypergraphs. We show that every $k$-hypergraph is either separable or…
Characterizing derived equivalences between algebras via combinatorial structures has recently become a popular topic. In this paper, we study admissible fractional Brauer graph algebras, a new subclass of self-injective special biserial…
Let xi be a non-null countable ordinal. We study the Borel subsets of the plane that can be made $\bormxi$ by refining the Polish topology on the real line. These sets are called potentially $\bormxi$. We give a Hurewicz-like test to…
We construct a class of II_1 factors M that admit unclassifiably many Cartan subalgebras in the sense that the equivalence relation of being conjugate by an automorphism of M is complete analytic, in particular non Borel. We also construct…
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…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
We construct Borel graphs which settle several questions in descriptive graph combinatorics. These include "Can the Baire measurable chromatic number of a locally finite Borel graph exceed the usual chromatic number by more than one?" and…
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.…
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 give a cohomological criterion for certain decomposition of Borel graphs, which is an analog of Dunwoody's work on accessibility of groups. As an application, we prove that a Borel graph $(X,G)$ with uniformly bounded degrees of…
The survey covers several topics related to the asymptotic structure of various combinatorial and analytic objects such as the path spaces in graded graphs (Bratteli diagrams), invariant measures with respect to countable groups, etc. The…
We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…