On uniquely k-determined permutations

Avgustinovich, Sergey and Kitaev, Sergey (2007) On uniquely k-determined permutations. In: 19th International Conference on Formal Power Series & Algebraic Combinatorics, 2007-07-02 - 2007-07-06, Nankai University.

Abstract

Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria for a permutation to be uniquely k-determined: one in terms of the distance between two consecutive elements in a permutation, and the other one in terms of directed hamiltonian paths in the certain graphs called path-schemes. Moreover, we describe a ¯nite set of prohibitions that gives the set of uniquely k-determined permutations. Those prohibitions make the application of the transfer matrix method possible for determining the number of uniquely k-determined permutations.

• 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:	Conference or Workshop Item(Poster)
  ID code:	49994
  Dates:	Date Event July 2007 Published
  Subjects:	Science > Mathematics
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	23 Oct 2014 14:09
  Last modified:	09 Apr 2024 06:02
  Related URLs:	Event
  URI:	https://strathprints.strath.ac.uk/id/eprint/49994