For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Strathclyde

Return to search Previous output Next output
Output 27 of 84 in the submission
Article title

Enumerating (2+2) -free posets by the number of minimal elements and other statistics

Type
D - Journal article
Title of journal
Discrete Mathematics
Article number
-
Volume number
159
Issue number
17
First page of article
2098
ISSN of journal
0012-365X
Year of publication
2011
URL
-
Number of additional authors
1
Additional information

<12>Enumeration of the much-studied (2+2)-free posets, equivalent to the well-known interval orders, was open for 40 years, until a generating function was found in 2010. Our paper provides a substantial generalization of this important generating function, incorporating 4 parameters, including the number of minimal elements, an important poset invariant. The paper has already been influential and led to work by three different researchers (Jelinek, Levande, Yan) who proved a conjecture posed in the paper, substantially simplifying the expression for the generating function and thus making it very useful for further investigation of the several important structures it enumerates.

Interdisciplinary
-
Cross-referral requested
10 - Mathematical Sciences
Research group
A - Theoretical Computer Science
Citation count
4
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-