Multi-avoidance of generalised patterns

Kitaev, Sergey (2003) Multi-avoidance of generalised patterns. Discrete Mathematics, 260 (1-3). pp. 89-100. ISSN 0012-365X (https://doi.org/10.1016/S0012-365X(02)00452-1)

Abstract

Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3-patterns without internal dashes, that is, where the pattern corresponds to a contiguous subword in a permutation.

ORCID iDs

Kitaev, Sergey ORCID: https://orcid.org/0000-0003-3324-1647

• Share and Export
  

  RDF+XMLBibTeXRIOXX2 XMLRDF+N-TriplesJSONDublin CoreAtomSimple MetadataReferMETSHTML CitationASCII CitationOpenURL ContextObjectEndNoteOpenURL ContextObject in SpanMODSMPEG-21 DIDLEP3 XMLData Cite XMLRIS (EndNote Online, Zotero, Ref manager, etc)RDF+N3Multiline CSV
• Item metadata

  Item type:	Article
  ID code:	49247
  Dates:	Date Event 6 January 2003 Published 21 December 2002 Published Online
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	16 Sep 2014 04:04
  Last modified:	11 Nov 2024 10:45
  Related URLs:	Related item
  URI:	https://strathprints.strath.ac.uk/id/eprint/49247