Abstract
An inversion sequence of length n is a word which satisfies for each the inequalities . In this paper, we present enumerations of four classes of inversion sequences that avoid a pattern of length 4. More precisely, we describe each class by a generating tree with 2 labels, and then we obtain an explicit formula for the generating function for the number of inversion sequences of length n that avoid either 0132, , , 0123, or 0321.
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.
