University of Strathclyde website
Digital Collections - University of Strathclyde Library
Search Results Previous Searches E-Shelf
Login End Session
Guest
Search 'System Number= 000004365' in 'General Silo' Collection [ Sorted by: Name/Title ] Refine search
Table view Full view
Record 1 of 1 1
Add to E-Shelf
e-item icon
Link(s)
PDF of thesis T14188 PDF of thesis T14188 - (679 K)
Title Interval order enumeration / Stuart A. Hannah.
Name Hannah, Stuart A. .
Abstract This thesis continues the study of interval orders and related structures, containing results on both the labeled and unlabeled variants. Following a result of Eriksen and Sjöstrand (2014) we identify a link between structures following the Fishburn distribution and Mahonian structures. This is used to detail a technique for the construction of Fishburn structures (structures in bijection with unlabeled interval orders) from appropriate Mahonian structures. This technique is introduced on a bivincular pattern of Bousquet-Mélou et al. (2010) and then used to introduce a previously unconsidered class of matchings; explicitly, zero alignment matchings according to the number of arcs which are both right-crossed and left-nesting. The technique is then used to identify a statistic on the factorial posets of Claesson and Linusson (2011) following the Fishburn distribution. Factorial posets mapped to zero by this statistic are canonically labeled factorial posets which may alternatively be viewed as unlabeled interval orders. As a consequence of our approach we find an identity for the Fishburn numbers in terms of the Mahonian numbers and discuss linear combinations of Fishburn patterns in a manner similar to that of the Mahonian combinations of Babson and Steingrímsson (2001). To study labeled interval orders 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. Adapting a bijection of Dukes, Jelínek and Kibitzke (2011), 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
Abstract ascent bottoms are given. This allows for a new formula for the number of labeled interval orders
Publication date 2015.
Name University of Strathclyde. Dept. of Computer and Information Sciences.
Thesis note Thesis Ph. D University of Strathclyde 2015 T14188

Powered by Digitool Contact us Electronic Library Services Library Home