IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v388y2021ics0096300320304720.html
   My bibliography  Save this article

Wilf equivalences between vincular patterns in inversion sequences

Author

Listed:
  • Auli, Juan S.
  • Elizalde, Sergi

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.

Suggested Citation

  • Auli, Juan S. & Elizalde, Sergi, 2021. "Wilf equivalences between vincular patterns in inversion sequences," Applied Mathematics and Computation, Elsevier, vol. 388(C).
    • Handle: RePEc:eee:apmaco:v:388:y:2021:i:c:s0096300320304720
    DOI: 10.1016/j.amc.2020.125514
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300320304720
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2020.125514?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:388:y:2021:i:c:s0096300320304720. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.