Length-four pattern avoidance in inversion sequences

DOI10.37236/10948zbMath1506.05006arXiv2112.15081OpenAlexW4311098389MaRDI QIDQ2112575

Rupert Li, Letong Hong

Publication date: 11 January 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.15081

zbMATH Keywords

avoidance classpattern avoidance for permutations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Special sequences and polynomials (11B83)

Related Items (6)

Generating Trees for 0021-Avoiding Inversion Sequences and a Conjecture of Hong and Li ⋮ Five classes of pattern avoiding inversion sequences under one roof: generating trees ⋮ An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences ⋮ Burstein’s permutation conjecture, Hong and Li’s inversion sequence conjecture and restricted Eulerian distributions ⋮ Subsequence frequency in binary words ⋮ Unnamed Item

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences
• Vincular patterns in inversion sequences
• Wilf equivalences between vincular patterns in inversion sequences
• Patterns in Inversion Sequences I
• Pattern avoidance in inversion sequences
• A Survey of Alternating Permutations
• Inversion sequences avoiding pairs of patterns
• Forests of label-increasing trees
• The on-line encyclopedia of integer sequences
• Patterns in Inversion Sequences II: Inversion Sequences Avoiding Triples of Relations
• Increasing trees and alternating permutations
• Consecutive Patterns in Inversion Sequences
• Consecutive patterns in inversion sequences II: avoiding patterns of relations
• Restricted permutations

This page was built for publication: Length-four pattern avoidance in inversion sequences