Name
Abstract | ||
|---|---|---|
It is shown that every partially ordered set with n elements admits an endomorphism with an image of a size at least n1/7 but smaller than n. We also prove that there exists a partially ordered set with n elements such that each of its non-trivial endomorphisms has an image of size O((n log n)1/3). |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1017/S0963548397003313 | Combinatorics, Probability & Computing |
Keywords | Field | DocType |
non-trivial endomorphisms,size o,n log n,n element,partially ordered sets,partially ordered set | Atom (order theory),Discrete mathematics,Combinatorics,Hausdorff maximal principle,Total order,Join and meet,Maximal element,Greatest element,Partially ordered set,Mathematics,Endomorphism | Journal |
Volume | Issue | ISSN |
7 | 1 | 0963-5483 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dwight Duffus | 1 | 111 | 36.63 |
| Tomasz Łuczak | 2 | 225 | 40.26 |
| Vojtěch Rödl | 3 | 887 | 142.68 |
| Andrzej Ruciński | 4 | 420 | 51.89 |