Decomposing labeled interval orders as pairs of permutations

Claesson, Anders and Hannah, Stuart A. (2014) Decomposing labeled interval orders as pairs of permutations. The Electronic Journal of Combinatorics, 21 (4). P4.16. ISSN 1077-8926 (https://doi.org/10.37236/4360)

Preview

Text. Filename: Claesson_Hannah_EJOC_2014_Decomposing_labeled_interval_orders_as_pairs.pdf Final Published Version Download (365kB)| Preview

Abstract

We introduce ballot matrices, a signed combinatorial structure whose definition naturally follows from the generating function for labeled interval orders. A sign reversing involution on ballot matrices is defined. We show that matrices fixed under this involution are in bijection with labeled interval orders and that they decompose to a pair consisting of a permutation and an inversion table. To fully classify such pairs, results pertaining to the enumeration of permutations having a given set of ascent bottoms are given. This allows for a new formula for the number of labeled interval orders.

• 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:	53749
  Dates:	Date Event 16 October 2014 Published 8 October 2014 Accepted
  Subjects:	Science > Mathematics
  Department:	Faculty of Science > Computer and Information Sciences
  Depositing user:	Pure Administrator
  Date deposited:	14 Jul 2015 08:52
  Last modified:	08 Apr 2024 22:00
  URI:	https://strathprints.strath.ac.uk/id/eprint/53749