Related papers: Coset relation algebras
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…
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…
We study the structure of separable elements in bipartite C$^{\ast}$-algebras, focusing on the existence and size of a separable neighbourhood around the identity element. While this phenomenon is well understood in the finite-dimensional…
We consider the problems of measurable isomorphisms and joinings, measurable centralizers and quotients for certain classes of ergodic group actions on infinite measure spaces. Our main focus is on systems of algebraic origin: actions of…
A block in a linear order is an equivalence class when factored by the block relation B(x,y), satisfied by elements that are finitely far apart. We show that every computable linear order with dense condensation-type (i.e. a dense…
We consider three types of entities for quantum measurements. In order of generality, these types are: observables, instruments and measurement models. If $\alpha$ and $\beta$ are entities, we define what it means for $\alpha$ to be a part…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
The coset construction is the most important tool to construct rational conformal field theories with known chiral data. For some cosets at small level, so-called maverick cosets, the familiar analysis using selection and identification…
In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…
In previous work, the authors introduced the notion of Q-Koszul algebras, as a tool to "model" module categories for semisimple algebraic groups over fields of large characteristics. Here we suggest the model extends to small…
Previous work has axiomatised the cardinality operation in relation algebras, which counts the number of edges of an unweighted graph. We generalise the cardinality axioms to Stone relation algebras, which model weighted graphs, and study…
We will show that almost all nonassociative relation algebras are symmetric and integral (in the sense that the fraction of both labelled and unlabelled structures that are symmetric and integral tends to 1), and using a Fra\"iss\'e limit,…
An amorphic association scheme has the property that any of its fusion is also an association scheme. In this paper we generalize the property to be amorphic to an arbitrary C-algebra and prove that any amorphic C-algebra is determined up…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
This paper is devoted to the study of analytic equivalence relations which are Borel graphable, i.e. which can be realized as the connectedness relation of a Borel graph. Our main focus is the question of which analytic equivalence…
Diassociative algebras form a categoy of algebras recently introduced by Loday. A diassociative algebra is a vector space endowed with two associative binary operations satisfying some very natural relations. Any diassociative algebra is an…
We study the partial orderings of the form $\langle {\mathbb P} ({\mathbb X}), \subset \rangle $, where ${\mathbb X}$ is a binary relational structure with the connectivity components isomorphic to a strongly connected structure ${\mathbb…
Resources and their use and consumption form a central part of our life. Many branches of science and engineering are concerned with the question of which given resource objects can be converted into which target resource objects. For…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…