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.

ORCID iDs

Claesson, Anders ORCID: https://orcid.org/0000-0001-5797-8673

• Share and Export
  

  ReferMultiline CSVJSONRIOXX2 XMLMPEG-21 DIDLRefWorksASCII CitationEndNoteMETSHTML CitationDublin CoreSimple MetadataRDF+XMLBibTeXAtomRDF+N3Data Cite XMLRDF+N-TriplesMODSOpenURL ContextObject in SpanOpenURL ContextObjectRIS (EndNote Online, Zotero, Ref manager, etc)EP3 XML
• 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:	11 Nov 2024 10:48
  Related URLs:	Journal or Publication
  URI:	https://strathprints.strath.ac.uk/id/eprint/49795