Commutativity conditions for groups arising from acyclic directed graphs and posets
From MaRDI portal
(Redirected from Publication:616389)
Abstract: Let be an acyclic digraph. For define to be the difference of the indegree and the outdegree of . An acyclic ordering of the vertices of is a one-to-one map that has the property that for all if , then . We prove that for every acyclic ordering of the following inequality holds: [sum_{xin V} e_{_{D}}(x)cdot g(x) ~geq~ frac{1}{2} sum_{xin V}[e_{_{D}}(x)]^2~.] The class of acyclic digraphs for which equality holds is determined as the class of comparbility digraphs of posets of order dimension two.
Recommendations
Cites work
- scientific article; zbMATH DE number 4191742 (Why is no real title available?)
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- A permutation group determined by an ordered set
- On orbits of antichains of positive roots
- Orbits of antichains in ranked posets
- Orbits of antichains revisited
This page was built for publication: Commutativity conditions for groups arising from acyclic directed graphs and posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616389)