On permutations avoiding partially ordered patterns defined by bipartite graphs

Kitaev, Sergey and Pyatkin, Artem (2023) On permutations avoiding partially ordered patterns defined by bipartite graphs. The Electronic Journal of Combinatorics, 30 (1). P1.27. ISSN 1077-8926 (https://doi.org/10.37236/11199)

Preview

Text. Filename: Kitaev_Pyatkin_EJC_2023_On_permutations_avoiding_partially_ordered_patterns_defined_by_bipartite_graphs.pdf Final Published Version License: Download (205kB)| Preview

Abstract

Partially ordered patterns (POPs) generalize the notion of classical patterns studied in the literature in the context of permutations, words, compositions and partitions. In this paper, we give a number of general, and specific enumerative results for POPs in permutations defined by bipartite graphs, substantially extending the list of known results in this direction. In particular, we completely characterize the Wilf-equivalence for patterns defined by the N-shape posets.

• 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:	84283
  Dates:	Date Event 10 February 2023 Published 12 January 2023 Accepted
  Subjects:	Science > Mathematics > Electronic computers. Computer science
  Department:	Faculty of Science > Mathematics and Statistics
  Depositing user:	Pure Administrator
  Date deposited:	17 Feb 2023 13:48
  Last modified:	16 Apr 2024 00:35
  URI:	https://strathprints.strath.ac.uk/id/eprint/84283