Jarik Neˇsetˇril suggested to the first author the investigation of notions of homogeneity for relational structures, where “isomorphism ” is replaced by “homomorphism” in the definition. Here we look in detail at what happens for posets. For the strict order, all five generalisations of homogeneity coincide, and we give a characterisation of the countable structures that arise. For the non-strict order, there is an additional class. The “generic poset ” plays an important role in the investigation. Key words: Poset, homomorphism, homogeneous, relational structure
In this paper we investigate the connection between infinite permutation monoids and bimorphism mono...
The main purpose of these lectures is to give an exposition of some basic material on ho-mogeneous s...
Contents 1 Introduction 2 2 G-posets 3 2.1 Definitions . . . . . . . . . . . . . . . . . . . . . . ...
In this paper, we state and prove two Fraïssé-style results that cover existence and uniqueness prop...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
AbstractA relational structure is called homogeneous if each isomorphism between its finite substruc...
This work analyses properties of relational structures that imply a high degree of symmetry. A struc...
AbstractA relational structure A is called k-homogeneous if each isomorphism between two k-element s...
This talk provides a story of equality of homomorphism-homogeneous classes. Cameron and Nesetril [1]...
A countable relational structure $M$ is called $ extit{set-homogeneous}$ if whenever two finite subs...
Homogeneous structures are a well studied research area and have variety uses like constructions in ...
AbstractA structure is called homogeneous if every isomorphism between finitely induced substructure...
Abstract. In this paper, we nd the inclusion relation among four cate-gories of posets, i.e., ideal-...
A homogenizable structure M is a structure where we may add a finite amount of new relational symbol...
We assign a relational structure to any finite algebra in a canonical way,using solution sets of equ...
In this paper we investigate the connection between infinite permutation monoids and bimorphism mono...
The main purpose of these lectures is to give an exposition of some basic material on ho-mogeneous s...
Contents 1 Introduction 2 2 G-posets 3 2.1 Definitions . . . . . . . . . . . . . . . . . . . . . . ...
In this paper, we state and prove two Fraïssé-style results that cover existence and uniqueness prop...
AbstractA relational first order structure is homogeneous if it is countable (possibly finite) and e...
AbstractA relational structure is called homogeneous if each isomorphism between its finite substruc...
This work analyses properties of relational structures that imply a high degree of symmetry. A struc...
AbstractA relational structure A is called k-homogeneous if each isomorphism between two k-element s...
This talk provides a story of equality of homomorphism-homogeneous classes. Cameron and Nesetril [1]...
A countable relational structure $M$ is called $ extit{set-homogeneous}$ if whenever two finite subs...
Homogeneous structures are a well studied research area and have variety uses like constructions in ...
AbstractA structure is called homogeneous if every isomorphism between finitely induced substructure...
Abstract. In this paper, we nd the inclusion relation among four cate-gories of posets, i.e., ideal-...
A homogenizable structure M is a structure where we may add a finite amount of new relational symbol...
We assign a relational structure to any finite algebra in a canonical way,using solution sets of equ...
In this paper we investigate the connection between infinite permutation monoids and bimorphism mono...
The main purpose of these lectures is to give an exposition of some basic material on ho-mogeneous s...
Contents 1 Introduction 2 2 G-posets 3 2.1 Definitions . . . . . . . . . . . . . . . . . . . . . . ...