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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
