Skip navigation


  • DSpace logo
  • Home
  • Collections
  • Researcher Profile
  • Explore by
    • Researcher Profile
  • VGU library
  • Help
  • User Guide
  • Sign on to:
    • My DSpace
    • Receive email
      updates
    • Edit Account details

VGU RESEARCH REPOSITORY


Please use this identifier to cite or link to this item: https://epub.vgu.edu.vn/handle/dlibvgu/93
DC FieldValueLanguage
dc.contributor.authorPhan Thuan Doen_US
dc.contributor.authorTran Thi Thu Huongen_US
dc.contributor.authorVincent Vajnovszkien_US
dc.date.accessioned2020-03-12T16:54:57Z-
dc.date.available2020-03-12T16:54:57Z-
dc.date.issued2019-
dc.identifier.urihttp://epub.vgu.edu.vn/handle/dlibvgu/93-
dc.description.abstractDespite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions of regular and colored regular set of forbidden patterns, which are particular cases of right-justified sets of forbidden patterns. We show the (colored) regularity of several sets of forbidden patterns (some of them involving variable length patterns) and we derive a general framework for the efficient generation of permutations avoiding them. The obtained generating algorithms are based on succession functions, a notion which is a byproduct of the ECO method introduced in the context of enumeration and random generation of combinatorial objects. For some classes of permutations falling under our general framework, the corresponding counting sequences are classical in combinatorics, such as Pell, Fibonacci, Catalan, Schröder and binomial transform of Padovan sequence. 44-53en_US
dc.language.isoenen_US
dc.publisherElsevieren_US
dc.relation.ispartofseriesDiscrete Applied Mathematics;Vol. 268-
dc.subjectPattern avoiding permutationen_US
dc.subjectRight-justified forbidden patternen_US
dc.subjectExhaustive generating algorithmen_US
dc.subjectSuccession functionen_US
dc.subjectECO methoden_US
dc.titleExhaustive generation for permutations avoiding (colored) regular sets of patternsen_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.dam.2019.04.014-
dc.relation.journaltypeSCI (Q2)en_US
item.fulltextNo Fulltext-
item.languageiso639-1other-
item.grantfulltextnone-
Appears in Collections:ARTICLE/BOOK PUBLICATION
Show simple item record

Page view(s)

42
checked on Aug 23, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items are protected by © Copyright of Vietnamese - German University Library

© Copyright 2020 by Vietnamese - German University Library.
Add: Ring road 4, Quarter 4, Thoi Hoa Ward, Ben Cat City, Binh Duong Province
Tel.:(0274) 222 0990. Ext.: 70206