Related papers: Structurable equivalence relations
In this paper, we are interested in solvable complete Lie algebras, over the field $\K=\R$ or $\mathbb{C}$, which admit a symplectic structure. Specifically, important classes are studied, and a description of complete Lie Algebra with the…
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
We make some beginning observations about the category $\mathbb{E}\mathrm{q}$ of equivalence relations on the set of natural numbers, where a morphism between two equivalence relations $R,S$ is a mapping from the set of $R$-equivalence…
We compare a number of different definitions of structure algebras and TKK constructions for Jordan (super)algebras appearing in the literature. We demonstrate that, for unital superalgebras, all the definitions of the structure algebra and…
A 1-parameter variation of Hodge structures corresponds to a holomorphic, horizontal, locally liftable map into a classifying space of Hodge structures. In this paper it is shown that such a map has a limit in the reductive Borel-Serre…
Let $G$ be a connected semi-simple group defined over and algebraically closed field, $T$ a fixed Cartan, $B$ a fixed Borel containing $T$, $S$ a set of simple reflections associated to the simple positive roots corresponding to $(T,B)$,…
Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…
Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence relations on the computably enumerable (c.e.) sets. The first…
Let $\mathfrak{g}$ be a Lie algebra, $E$ a vector space containing $\mathfrak{g}$ as a subspace. The paper is devoted to the \emph{extending structures problem} which asks for the classification of all Lie algebra structures on $E$ such…
Let $H$ be a group and $E$ a set such that $H \subseteq E$. We shall describe and classify up to an isomorphism of groups that stabilizes $H$ the set of all group structures that can be defined on $E$ such that $H$ is a subgroup of $E$. A…
In this paper we focus on a certain self-distributive multiplication on coalgebras, which leads to so-called rack bialgebra. Inspired by semi-group theory (adapting the Suschkewitsch theorem), we do some structure theory for rack bialgebras…
We show that there is an equivalence in any $n$-topos $\mathcal{X}$ between the pointed and $k$-connective objects of $\mathcal{X}$ and the $\mathbb{E}_k$-group objects of the $(n-k-1)$-truncation of $\mathcal{X}$. This recovers, up to…
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably enumerable structures are one of the most important objects of…
The group of automorphisms of the Cuntz algebra $\mathcal{O}_{2}$ is a Polish group with respect to the topology of pointwise convergence in norm. Our main result is that the relations of conjugacy and cocycle conjugacy of automorphisms of…
Gao and Jackson showed that any countable Borel equivalence relation (CBER) induced by a countable abelian Polish group is hyperfinite. This prompted Hjorth to ask if this is in fact true for all CBERs classifiable by (uncountable) abelian…
The Koszul homology algebra of a commutative local (or graded) ring $R$ tends to reflect important information about the ring $R$ and its properties. In fact, certain classes of rings are characterized by the algebra structure on their…
Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…
A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over a cohesive set of natural numbers. A cohesive set is an…
A relational structure is a core, if all its endomorphisms are embeddings. This notion is important for computational complexity classification of constraint satisfaction problems. It is a fundamental fact that every finite structure has a…
We systematically investigate three different equivalence relations of connectedness: being connected by arcs, being connected by continua and being connected by chains of continua of decreasing diameter. The investigation is conducted from…