This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics on these structures under this bijection and prove that some of these statistics are equidistributed. Several special classes of matrices are shown to have simple formulations in terms of ascent sequences. Binary matrices are shown to correspond to ascent sequences with no two adjacent entries the same. Bidiagonal matrices are shown to be related to order-consecutive set partitions and a simple condition on the ascent sequences generate this class.
[1]
Sergey Kitaev,et al.
(2+2)-free Posets, Ascent Sequences and Pattern Avoiding Permutations
,
2008,
J. Comb. Theory, Ser. A.
[2]
J. Remmel,et al.
Enumerating (2+2)-free posets by indistinguishable elements
,
2010,
1006.2696.
[3]
Peter C. Fishburn,et al.
Interval graphs and interval orders
,
1985,
Discret. Math..
[4]
Jutta Mitas.
Tackling the jump number of interval orders
,
1991
.
[5]
Colin L. Mallows,et al.
Enumerating Nested and Consecutive Partitions
,
1995,
J. Comb. Theory, Ser. A.