Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns

Claesson, Anders and Mansour, Toufik (2005) Enumerating permutations avoiding a pair of Babson-Steingrímsson patterns. Ars Combinatoria, 77.

Abstract

This article discusses enumerating permutations whilst avoiding a pair of Babson-Steingrímsson patterns.

• 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:	49795
  Dates:	Date Event October 2005 Published
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	14 Oct 2014 13:55
  Last modified:	08 Apr 2024 21:44
  Related URLs:	Journal or Publication
  URI:	https://strathprints.strath.ac.uk/id/eprint/49795