Related papers: Structurable equivalence relations

If E is an equivalence relation Borel reducible to E_1 \times E_3 then either E is Borel reducible to the equality of countable sets of reals or E_1 is Borel reducible to E. The "either" case admits further strengthening.

Third-order ordinary differential equations with Lie symmetry algebras isomorphic to the nonsolvable algebra $\mathfrak{sl}(2,\mathbb{R})$ admit solvable structures. These solvable structures can be constructed by using the basis elements…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

We study the complexity of the classification problem of conjugacy on dynamical systems on some compact metrizable spaces. Especially we prove that the conjugacy equivalence relation of interval dynamical systems is Borel bireducible to…

We investigate stability properties of the reductive Borel-Serre categories; these were introduced as a model for unstable algebraic K-theory in previous work. We see that they exhibit better homological stability properties than the…

We study the class of compact spaces that appear as structure spaces of separable Banach lattices. In other words, we analyze what $C(K)$ spaces appear as principal ideals of separable Banach lattices. Among other things, it is shown that…

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.

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…

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

It is well-known that every algebraic group of type F_4 is the automorphism group of an exceptional Jordan algebra, and that up to isogeny all groups of type ^1E_6 with trivial Tits algebras arise as the isometry groups of norm forms of…

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…

Let $S_\infty$ denote the topological group of permutations of the natural numbers. We study the complexity of the isomorphism relation on classes of closed subgroups $S_\infty$ in the setting of Borel reducibility between equivalence…

A equivalence relation, preserving the Chern-Weil form, is defined between connections on a complex vector bundle. Bundles equipped with such an equivalence class are called Structured Bundles, and their isomorphism classes form an abelian…

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

We study topological realizations of countable Borel equivalence relations, including realizations by continuous actions of countable groups, with additional desirable properties. Some examples include minimal realizations on any perfect…

The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…

This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…

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…

Given a countable transitive model of set theory and a partial order contained in it, there is a natural countable Borel equivalence relation on generic filters over the model; two are equivalent if they yield the same generic extension. We…

The class of skew lattices can be seen as an algebraic category. It models an algebraic theory in the category of Sets where the Green's relation D is a congruence describing an adjunction to the category of Lattices. In this paper we will…