Weak orders admitting a perpendicular linear order
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.
- Betweenness, orders and interval graphs
- scientific article; zbMATH DE number 3914376 (Why is no real title available?)
- Perpendicular orders
- Prime two-dimensional orders and perpendicular total orders
- Relational systems with trivial endomorphisms and polymorphisms
- The number of orthogonal permutations
- Unary polynomials in algebras. I
- Weak orders admitting a perpendicular linear order
- Prime two-dimensional orders and perpendicular total orders
- Perpendicular orders
- Orthogonal countable linear orders
- Geometric representations of weak orders
- The number of weak orders. A comment
- The order on the rationals has an orthogonal order with the same order type
- Weak orders admitting a perpendicular linear order
- Order extensions and the fixed point property
This page was built for publication: Weak orders admitting a perpendicular linear order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861798)