Abstract
Two combinatorial identities are considered. These identities imply that $$\exp $$ and $$\log $$ are mutually inverse to one another even in the case where the variable is a noncommutative symbol. The proofs are given by enumeration of permutations and flags in a finite set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have