Let be a partial order on a countable set V such that there exists a minimum element a ∈ V and {u ∈ V : u v} is finite for each v ∈ V . An item of information is to be broadcast to the elements of V according to the policy in the following sense: a is initially informed and broadcasting to v 6= a begins as soon as all elements u ≺ v are informed; the time required to broadcast the information i...

We employ partially ordered sets to describe the stratification of a social system, using rank to define the strata. We present a simple method of computing the matrix corresponding to the Hasse diagram and prove its correctness. This methodology is applied to analyze the hierarchy of countries that have won at least one Olympic medal. Four different definitions of dominance are given, leading ...

Let P be a partially ordered set. A function φ : P → P is an endomorphism of P if for every two elements x, y of P , the inequality φ(x) 6 φ(y) holds whenever x 6 y. Obviously, the identity mapping is a (trivial ) endomorphism. Here, however, we will be interested in endomorphisms with an image of size less than |P |, i.e. endomorphisms which are not automorphisms of P . We will refer to them a...