Ascent sequences and upper triangular matrices containing non-negative integers
Summary: 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.
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- Refining the bijections among ascent sequences, \((2+2)\)-free posets, integer matrices and pattern-avoiding permutations
- An operator on ascent sequences
- Pattern avoidance in ascent sequences
- scientific article; zbMATH DE number 6683578
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Transport of patterns by Burge transpose
- Weak ascent sequences and related combinatorial structures
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Ascent sequences avoiding pairs of patterns
- 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
- Ascent sequences and 3-nonnesting set partitions
- Bi-symmetric multiple equidistributions on ascent sequences
- Symmetric generating functions and Euler-Stirling statistics on permutations
- scientific article; zbMATH DE number 6385390 (Why is no real title available?)
- $n!$ matchings, $n!$ posets
- Web worlds, web-colouring matrices, and web-mixing matrices
- Some enumerative results related to ascent sequences
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Partitions and partial matchings avoiding neighbor patterns
- Catalan pairs and Fishburn triples
- Partition and composition matrices
- An operator on ascent sequences
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
- Fishburn trees
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- On a conjecture about enumerating \((2+2)\)-free posets
- Enumerating pattern-avoiding Fishburn permutations subject to seven statistics
- Difference ascent sequences
- Counting general and self-dual interval orders
- Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers
- Modified ascent sequences and Bell numbers
- Equidistributed statistics on Fishburn matrices and permutations
- Modified ascent sequences avoiding a pattern of length 4
- Ascent sequences and weak ascent sequences avoiding a quadruple of length-3 patterns
- Pattern-avoiding modified ascent sequences
- Modified difference ascent sequences and Fishburn structures
- Pattern avoidance in revised ascent sequences
- Difference ascent sequences and related combinatorial structures
- On naturally labelled posets and permutations avoiding 12--34
- Ascent sequences avoiding a triple of length-3 patterns
- Stoimenow matchings avoiding multiple Catalan patterns simultaneously
- On ascent sequences avoiding 021 and a pattern of length four
This page was built for publication: Ascent sequences and upper triangular matrices containing non-negative integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976697)