
The authors characterize the finite weak orders admitting a perpendicular linear order and give two basic results. First, every linear order having at least four elements has a perpendicular linear order and, second, if \(q(n)\) denotes the number of linear orders perpendicular to the natural order on \([1, \ldots, n]\), then \(\lim_{n \rightarrow \infty} \frac{q(n)}{n!} = e^{-2} = 0,1353\ldots\). The main result of this paper, Theorem 3, gives necessary and sufficient conditions for a weak order \(P\) to admit a perpendicular linear order \(L\). Essentially Theorem 3 says that such a linear order exists if and only if the levels of \(P\) are not ``too big''.
Weak order, Maximal clone, Ordered set, Order-preserving map, Theoretical Computer Science, Combinatorics of partially ordered sets, Partial orders, general, Endomorphism, Perpendicular orders, Discrete Mathematics and Combinatorics, Autonomous set, Retractile set
Weak order, Maximal clone, Ordered set, Order-preserving map, Theoretical Computer Science, Combinatorics of partially ordered sets, Partial orders, general, Endomorphism, Perpendicular orders, Discrete Mathematics and Combinatorics, Autonomous set, Retractile set
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
