Counting general and self-dual interval orders

DOI10.1016/j.jcta.2011.11.010zbMath1234.05025arXiv1106.2261WikidataQ60692217 ScholiaQ60692217MaRDI QIDQ662031

Vít Jelínek

Publication date: 11 February 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

interval orders; \((2+2)\)-free posets; self-dual posets

Mathematics Subject Classification ID

06A06: Partial orders, general

05A15: Exact enumeration problems, generating functions

Related Items

Proof of a bi-symmetric septuple equidistribution on ascent sequences, Congruences for Taylor expansions of quantum modular forms, Catalan pairs and Fishburn triples, Asymptotics for the number of row-Fishburn matrices, A new decomposition of ascent sequences and Euler-Stirling statistics, Asymptotics and statistics on Fishburn matrices and their generalizations, Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations, Hereditary semiorders and enumeration of semiorders by dimension, Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations, On \(q\)-series identities related to interval orders, Enumeration of irredundant forests, Bi-symmetric multiple equidistributions on ascent sequences, Symmetric generating functions and Euler-Stirling statistics on permutations

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
• 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
• Ascent sequences and upper triangular matrices containing non-negative integers
• (2+2)-free posets, ascent sequences and pattern avoiding permutations
• Interval lengths for interval orders: A minimization problem
• Interval graphs and interval orders
• Counting interval orders
• On certain subgraphs of a complete transitively directed graph
• Height counting of unlabeled interval and \(N\)-free posets.
• Intransitive indifference with unequal indifference intervals
• $n!$ matchings, $n!$ posets
• ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
• Vassiliev invariants and a strange identity related to the Dedekind eta-function