Abstract
In this paper, we enumerate members of the set NCn of non-crossing partitions of length n according to the number of occurrences of several infinite families of subword patterns each containing repeated letters. As a consequence of our results, we obtain explicit generating function formulas counting the members of NCn for n ? 0 according to all subword patterns of length three containing a repeated letter. In particular, we find extensions of the subword equivalences 211 ? 221, 1211 ? 1121 and 112 ? 122 over NCn.
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 callDisclaimer: 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.
