Related papers: Binary simple homogeneous structures

Suppose that M is an infinite structure with finite relational vocabulary such that every relation symbol has arity at most 2. If M is simple and homogeneous then its complete theory is supersimple with finite SU-rank which cannot exceed…

Suppose that M is countable, binary, primitive, homogeneous, and simple, and hence 1-based. We prove that the SU-rank of the complete theory of M is~1. It follows that M is a random structure. The conclusion that M is a random structure…

A homogenizable structure $\mathcal{M}$ is a structure where we may add a finite amount of new relational symbols to represent some $\emptyset-$definable relations in order to make the structure homogeneous. In this article we will divide…

A structure is called homogeneous if every isomorphism between finite substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of homogeneity:…

Let $V$ be a finite relational vocabulary in which no symbol has arity greater than 2. Let $M$ be countable $V$-structure which is homogeneous, simple and 1-based. The first main result says that if $M$ is, in addition, primitive, then it…

A homogeneous symmetric structure on an associative superalgebra A is a non-degenerate, supersymmetric, homogeneous (i.e. even or odd) and associative bilinear form on A. In this paper, we show that any associative superalgebra with non…

In this paper, we mainly study structure of multiplicative simple Hom-Jordan algebras. We talk about equivalent conditions for multiplicative Hom-Jordan algebras being solvable, simple and semi-simple. As an application, we give a theorem…

Let M be ternary, homogeneous and simple. We prove that if M is finitely constrained, then it is supersimple with finite SU-rank and dependence is $k$-trivial for some $k < \omega$ and for finite sets of real elements. Now suppose that, in…

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

An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…

We provide a classification of the homogeneous 3-dimensional permutation structures, i.e. homogeneous structures in a language of 3 linear orders, partially answering a question of Cameron. We also arrive at a natural description of all…

We study definable sets $D$ of SU-rank 1 in $M^{eq}$, where $M$ is a countable homogeneous and simple structure in a language with finite relational vocabulary. Each such $D$ can be seen as a `canonically embedded structure', which inherits…

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…

We classify contact manifolds $(M,\mathcal D)$ which are homogeneous under a connected semisimple Lie group $G$, and symmetric in the sense that there exists a contactomorphism of $(M,\mathcal D)$ normalizing $G$, fixing a point $o$ in $M$…

This paper is mainly devoted to a structure study of Hom-alternative algebras . Equivalent conditions for Hom-alternative algebras being solvable, simple and semi-simple are displayed. Moreover some results about Hom-alternative bimodule…

We classify the homogeneous finite-dimensional permutation structures, i.e., homogeneous structures in a language of finitely many linear orders, giving a nearly complete answer to a question of Cameron, and confirming the classification…

In this paper, the notions of transitivity and homogeneity in binary $G$-spaces are studied. These notions coincide for distributive binary $G$-spaces. For compact $G$, it is shown that distributive transitive binary $G$-spaces are coset…

In this paper we shall prove that any $2$-transitive finitely homogeneous structure with a supersimple theory satisfying a generalized amalgamation property is a random structure. In particular, this adapts a result of Koponen for binary…