Abstract
Letn>1. The number of all strictly increasing selfmappings of a 2n-element crown is $$n\left( {\left( {\begin{array}{*{20}c} {2n} \\ n \\ \end{array} } \right) + 2} \right)$$ . The number of all order-preserving selfmappings of a 2n-element crown is $$n\left( {2 + \sum\limits_{k = 0}^n {\left[ {\left( {\begin{array}{*{20}c} {n + k} \\ {2k} \\ \end{array} } \right) + \left( {\begin{array}{*{20}c} {n + k - 1} \\ {2k} \\ \end{array} } \right)\left( {\begin{array}{*{20}c} {2k} \\ k \\ \end{array} } \right)} \right]} } \right).$$
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.