Self-dual interval orders and row-Fishburn matrices

zbMATH Open1243.05015arXiv1111.4723MaRDI QIDQ426862FDOQ426862

Authors: Sherry H. F. Yan, Yuexiao Xu 

Publication date: 12 June 2012

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

Abstract: Recently, Jel'{i}nek derived that the number of self-dual interval orders of reduced size $n$ is twice the number of row-Fishburn matrices of size $n$ by using generating functions. In this paper, we present a bijective proof of this relation by establishing a bijection between two variations of upper-triangular matrices of nonnegative integers. Using the bijection, we provide a combinatorial proof of the refined relations between self-dual Fishburn matrices and row-Fishburn matrices in answer to a problem proposed by Jel'{i}nek.

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Counting self-dual interval orders
• Counting general and self-dual interval orders
• Equidistributed statistics on Fishburn matrices and permutations
• Asymptotics for the number of row-Fishburn matrices
• Fishburn diagrams, Fishburn numbers and their refined generating functions

zbMATH Keywords

row-fishburn matrixself-dual fishburn matrixself-dual interval order

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30)

Cited In (4)

• Self-dual intervals in the Bruhat order
• On \(q\)-series identities related to interval orders
• Counting self-dual interval orders
• Counting general and self-dual interval orders

This page was built for publication: Self-dual interval orders and row-Fishburn matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426862)