Dukes, Mark and Parviainen, Robert (2010) Ascent sequences and upper triangular matrices containing non-negative integers. The Electronic Journal of Combinatorics, 17 (1).
v17i1r53.pdf - Submitted Version
Download (171kB) | Preview
The significance of this paper is the introduction of a bijection from ascent sequences to a class of upper triangular integer-valued matrices. Ascent sequences have been shown to uniquely encode interval orders, Stoimenow matchings, and a class of pattern avoiding permutations. This bijection therefore provides a link between this new class of matrices and the aforementioned combinatorial objects, a main goal of the area of bijective combinatorics. This correspondence has since proved instrumental in solving (multi-statistic) enumeration questions related to these structures.
|Keywords:||ascent squares, upper triangular matrices, natural statistics, Electronic computers. Computer science, Computational Theory and Mathematics, Geometry and Topology, Theoretical Computer Science|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||18 Oct 2011 14:13|
|Last modified:||15 Apr 2015 11:19|
Actions (login required)