Abstract
We enumerate involutions avoiding any single pattern of length three according to the statistic ‘number of visible pairs’, namely, the number of non-adjacent columns in the bargraph representation of a given permutation that is mutually visible to each other. The proofs are combinatorial and reside on well-known bijections between pattern avoiding involutions and lattice paths.
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.
