Comparability invariance of the fixed point property
The comparability graph of an ordered set P is the undirected graph whose vertex set is P and in which two vertices x,y are adjacent if and only if \(x<y\) or \(x>y\). A property of an ordered set is called comparability invariant, if two arbitrary ordered sets with isomorphic comparability graphs either both have this property, or both have not. If P, Q are ordered sets and \(a\in P\), then P(a,Q) is the ordered set obtained from P by replacing a by Q. An ordered set P is said to have the fixed point property, if every order-preserving mapping from P to P has at least one fixed point. Three theorems are proved. The first of them has an auxiliary character; the further ones are the following. Theorem 2. Let P and Q be finite ordered sets with \(a\in P\). Then P(a,Q) has the fixed point property if and only if either (i) P and Q both have the fixed point property; or (ii) P has the fixed point property, Q does not, and there is no order- preserving map \(f: P\to P\) which fixes only a and sends no element above or below a to a. Theorem 3. The fixed point property is comparability invariant for finite ordered sets.
- Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
- Two poset polytopes
- A combinatorial bijection between linear extensions of equivalent orders
- Is there a diagram invariant?
- Algorithms for the fixed point property
- Two order invariants related to the fixed point property
- Asymptotic fixed point theorem for infinite partially ordered sets
- Fixed points of posets and clique graphs
- On \(\text{CC}\)-comparability invariance of the fixed point property
- Weak-order extensions of an order.
- Comparability invariance results for tolerance orders
- Invariants of finite comparability graphs
- From finite posets to chain complete posets having no infinite antichain
- The fixed point property in the set of all order relations on a finite set
- Clique divergent clockwork graphs and partial orders
- On The Fixed Point Property of Finite Ordered Sets
- Minuscule analogues of the plane partition periodicity conjecture of Cameron and Fon-Der-Flaass
- scientific article; zbMATH DE number 3893249 (Why is no real title available?)
- A recurrence for linear extensions
- Minuscule Doppelgängers, The Coincidental down-Degree Expectations Property, and Rowmotion
- Contiguity orders
- The P-associahedron f-vector is a comparability invariant
- On the f-vectors of poset associahedra
- Automorphisms and products of ordered sets
- On the number of k-realizations of an ordered set
- Interval dimension is a comparability invariant
- The fixed vertex property for graphs
This page was built for publication: Comparability invariance of the fixed point property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1065836)
