Related papers: Different Similarities

We present an example of two countable $\omega$-categorical structures, one of which has a finite relational language, whose endomorphism monoids are isomorphic as abstract monoids, but not as topological monoids -- in other words, no…

We consider hierarchical structures such as Fibonacci sequences and Penrose tilings, and examine the consequences of different choices for the definition of isomorphism. In particular we discuss the role such a choice plays with regard to…

We establish some similarities/analogies between uncountable cardinals or powersets and the class $V$ of all sets. They concern mainly the Boolean algebras ${\cal P}(\kappa)$, for a regular cardinal $\kappa$, and ${\cal C}(V)$ (the class of…

Linear categories naturally have several identification relations : isomorphisms, categorical equivalences and Morita equivalences. In this thesis, we construct the classifying stacks for these three relations ($\ukcatiso$, $\ukcateq$,…

A famous result due to Lov\'{a}sz states that two finite relational structures $M$ and $N$ are isomorphic if, and only if, for all finite relational structures $T$, the number of homomorphisms from $T$ to $M$ is equal to the number of…

The classical Morita Theorem for rings established the equivalence of three statements, involving categorical equivalences, isomorphisms between corners of finite matrix rings, and bimodule homomorphisms. A fourth equivalent statement…

We present an expository overview of the monoidal structures in the category of linearly compact vector spaces. Bimonoids in this category are the natural duals of infinite-dimensional bialgebras. We classify the relations on words whose…

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…

For a finite lattice $\Lambda$, $\Lambda$-ultrametric spaces have, among other reasons, appeared as a means of constructing structures with lattices of equivalence relations embedding $\Lambda$. This makes use of an isomorphism of…

We study dualities between classes of relational topological structures, given by Hom-functors. We show that there exists a 2-element structure with infinitely many relations, which reconstructs all other structures generated by a 2-element…

Consider complex semisimple Lie algebras of a given dimension specified by their structure constants. We describe a finite collection of rational functions in the structure constants that form a complete set of invariants: two sets of…

We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel reductions to compare classes of countable structures. This…

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of…

We give a detailed exposition of the homotopy theory of equivalence relations, perhaps the simplest nontrivial example of a model structure.

We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…

A relational structure $\mathbb{X}$ is called reversible iff each bijective homomorphism from $\mathbb{X}$ onto $\mathbb{X}$ is an isomorphism, and linear orders are prototypical examples of such structures. One way to detect new reversible…

We study 2-monads and their algebras using a Cat-enriched version of Quillen model categories, emphasizing the parallels between the homotopical and 2-categorical points of view. Every 2-category with finite limits and colimits has a…

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,…

Prior work of Gavryushkin, Khoussainov, Jain and Stephan investigated what algebraic structures can be realised in worlds given by a positive (= recursively enumerable) equivalence relation which partitions the natural numbers into…

Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…