Wilf equivalences between vincular patterns in inversion sequences

Juan S. Auli and Sergi Elizalde

Applied Mathematics and Computation, 2021, vol. 388, issue C

Abstract: Inversion sequences are finite sequences of non-negative integers, where the value of each entry is bounded from above by its position. They provide a useful encoding of permutations. Patterns in inversion sequences have been studied by Corteel–Martinez–Savage–Weselcouch and Mansour–Shattuck in the classical case, where patterns can occur in any positions, and by Auli–Elizalde in the consecutive case, where only adjacent entries can form an occurrence of a pattern. These papers classify classical and consecutive patterns of length 3 into Wilf equivalence classes according to the number of inversion sequences avoiding them.

Keywords: Inversion sequence; Pattern avoidance; Vincular pattern; Wilf equivalence; Generating tree (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300320304720
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:388:y:2021:i:c:s0096300320304720

DOI: 10.1016/j.amc.2020.125514

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().