Inversions, cuts, and orientations (Q2640623): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Ivan Rival / rank | |||
Property / author | |||
Property / author: Ivan Rival / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3941433 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Retracts of hypercubes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Diagrams, orientations, and varieties / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Path length in the covering graph of a lattice / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs Orientable as Distributive Lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5832095 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Unoriented graphs of modular lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5181402 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Planar Lattices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5676236 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5676237 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4405190 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of diagrams / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3291034 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Is there a diagram invariant? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On graphs that can be oriented as diagrams of ordered sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On reorienting graphs by pushing down maximal vertices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3726174 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3222890 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Antichain cutsets / rank | |||
Normal rank |
Latest revision as of 14:34, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inversions, cuts, and orientations |
scientific article |
Statements
Inversions, cuts, and orientations (English)
0 references
1991
0 references
A reorientation of an ordered set is an orientation of its covering graph. A pushdown is a reorientation Q of an ordered set P which can be obtained in the following way: Fix a maximal element a of P and reverse the edges of the diagram of P which have a as endpoint. A sequence of pushdowns is called an inversion. The following theorem is proved: An ordered set is an inversion of the finite ordered set P iff the reversed edges can be partitioned into cuts of P. Here a subset E of edges of P (say E consists of the covering pairs \(a_ 1\succ b_ 1\), \(a_ 2\succ b_ 2\),...) is said to be a cut if there is no element a in P which is connected to some \(a_ i\) and to some \(b_ j\) in the diagram obtained from P by removing all of the edges of E. Applications to the enumeration and complexity of reorientations are given.
0 references
orientation of covering graph
0 references
reorientation of an ordered set
0 references
pushdown
0 references
diagram
0 references
inversion
0 references
enumeration
0 references
complexity
0 references