Homogeneity in finite ordered sets
The author deals with the problem of giving classifications for a class of combinatorial structures which satisfy certain homogeneity conditions. The natural condition is to ask for every isomorphism between finite substructures to be extendible to an automorphism of the whole structure. However, if \((X,\leq)\) is a finite ordered set then the orbits of its automorphism group are antichains of \((X,\leq)\), in particular, \(\Aut(X,\leq)\) can only be transitive on \(X\) if \((X,\leq)\) is trivial. Thus, for finite ordered sets we have to consider other concepts of homogeneity. It is shown that a finite ordered set is tower-homogeneous if and only if it can be built up from singletons stepwise by constructions of three different types.
- Countable homogeneous partially ordered sets
- Generalized wreath products and the lattice of normal subgroups of a group
- Homogeneity conditions in graphs
- scientific article; zbMATH DE number 3879136 (Why is no real title available?)
- scientific article; zbMATH DE number 4198314 (Why is no real title available?)
- scientific article; zbMATH DE number 4158683 (Why is no real title available?)
- Linear spaces with flag-transitive automorphism groups
This page was built for publication: Homogeneity in finite ordered sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1311421)