Related papers: Structurable equivalence relations
We consider the factorisation problem for bialgebras: when a bialgebra $K$ factorises as $K=HL$, where $H$ and $L$ are algebras and coalgebras (but not necessarly bialgebras). Given two maps $R: H\ot L\to L\ot H$ and $W:L\ot H\to H\ot L$,…
For a Dedekind domain $R$ with field of fractions $K$ a classical $R$-order in a semisimple $K$-algebra $A$ is an $R$-projective $R$-subalgebra $\Lambda$ of $A$ such that $K\Lambda=A$. We study differential graded $K$-algebras which are…
We generalise the main theorems from the paper "The Borel cardinality of Lascar strong types" by I. Kaplan, B. Miller and P. Simon to a wider class of bounded invariant equivalence relations. We apply them to describe relationships between…
We consider an old question of Slaman and Steel: whether Turing equivalence is an increasing union of Borel equivalence relations none of which contain a uniformly computable infinite sequence. We show this question is deeply connected to…
Connectivity is a homotopy invariant property of separable C*-algebras which has three notable consequences: absence of nontrivial projections, quasidiagonality and a more geometric realization of KK-theory for nuclear C*-algebras using…
We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…
In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…
We compute all complex structures on indecomposable 6-dimensional real Lie algebras and their equivalence classes. We also give for each of them a global holomorphic chart on the connected simply connected Lie group associated to the real…
We study a new notion of reduction between structures called enumerable functors related to the recently investigated notion of computable functors. Our main result shows that enumerable functors and effective interpretability with the…
A sibling of a relational structure $R$ is any structure $S$ which can be embedded into $R$ and, vice versa, in which $R$ can be embedded. Let $sib(R)$ be the number of siblings of $R$, these siblings being counted up to isomorphism.…
A correspondence functor is a functor from the category of finite sets and correspondences to the category of k-modules, where k is a commu-tative ring. A main tool for this study is the construction of a correspondence functor associated…
We compute the equivariant K-theory with integer coefficients of an equivariantly formal isotropy action, subject to natural hypotheses which cover the three major classes of known examples. The proof proceeds by constructing a map of…
We investigate natural variations of behaviourally correct learning and explanatory learning -- two learning paradigms studied in algorithmic learning theory -- that allow us to ``learn'' equivalence relations on Polish spaces. We give a…
We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…
The present article is part of a research program the aim of which is to find all indecomposable solvable extensions of a given class of nilpotent Lie algebras. Specifically in this article we consider a nilpotent Lie algebra n that is…
We show that, up to Morita equivalence, any finite-dimensional algebra with a suitable homological system, admits an exact Borel subalgebra. This generalizes a theorem by Koenig, K\"ulshammer and Ovsienko, which holds for quasi-hereditary…
This paper generalizes the classification in a paper of Dimitrov and Penkov of Borel subalgebras of gl_infty. Root-reductive Lie algebras are direct limits of finite-dimensional reductive Lie algebras along inclusions preserving the root…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization of the class $\mathbf{InfEx}_{\cong}$, consisting of the…
In this paper, we establish a structure theorem for connected graded Hopf algebras over a field of characteristic $0$ by claiming the existence of a family of homogeneous generators and a total order on the index set that satisfy some…