Decomposing labeled interval orders as pairs of permutations

zbMath1298.05023arXiv1405.2441MaRDI QIDQ463061

Stuart A. Hannah, Anders Claesson

Publication date: 23 October 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.2441

zbMATH Keywords

interval order\(2+2\)-free posetascent bottomballot matrixcomposition matrixFishburnsign reversing involution

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Related Items (1)

The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group

Cites Work

• Partition and composition matrices
• Composition matrices, \((2+2)\)-free posets and their specializations
• On a conjecture about enumerating \((2+2)\)-free posets
• An obvious proof of Fishburn's interval order theorem
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Fishburn diagrams, Fishburn numbers and their refined generating functions
• Intransitive indifference with unequal indifference intervals
• Vassiliev invariants and a strange identity related to the Dedekind eta-function
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposing labeled interval orders as pairs of permutations