Abstract
We give combinatorial proofs of the primary results developed by Stanley for deriving enumerative properties of differential posets. In order to do this we extend the theory of combinatorial differential equations developed by Leroux and Viennot.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have