A Proof of Stanley's Characterization for a Simplicial Complex to be an Order Complex
スポンサーリンク
概要
- 論文の詳細を見る
A characterization for a simplicial complex to be an order complex has been shown without the proof by R. Stanley. Another one has been shown by H. Narushima, T. Minezaki and A. Koriyama. A proof for the Stanley's characterization is given through Narushima-Minezaki-Koriyama Theorem.
- 東海大学の論文
著者
関連論文
- The Number Tables of the Command Flow Numbers on a Boolean Lattice and a Partition Lattice
- A Tag Type Automaton with a Double Reading Head
- A Move Problem on Weighted Digraphs
- Order Preserving Maps and Classification of Partially Ordered Sets
- A Class of Recurrence Relations on Acyclic Digraphs of Poset Type (Applied Combinatorial Theory and Algorithms)
- Further Results on Order Maps
- Some Properties of the Distortion Index/Sequence on All MPRsComputational Complexity of Graph Isomorphism Problem(Special Issue on Selected Papers from LA Symposium)
- The Number Table of the Coefficients of the Command Flow Polynomial on a Boolean Lattice
- An Asymptotic Formula for the Number of Chains in a Boolean Lattice : a survey and another proof
- Order Maps and Cardinal Congruence Classes on Partitions
- A Necessary and Sufficient Condition for a Simplicial Complex to be an Order Complex and its Checking Computer Algorithm
- A Proof of Stanley's Characterization for a Simplicial Complex to be an Order Complex
- The Order Complexes on the 2-sphere
- The Lightest Totalization of an Endnode Labelling of a Non-tree Graph II
- Analysis of the Command Flow Numbers I : Boolean Lattices (Graphs and Combinatorics III)
- A Survey of Enumerative Combinatorial Theory and A Problem
- On a Hereditary Poset
- A Method for Counting the Number of Chains in a Partially Ordered Set