Ascent sequences and upper triangular matrices containing non-negative integers
From MaRDI portal
Publication:976697
zbMATH Open1230.05008arXiv0909.3486MaRDI QIDQ976697FDOQ976697
Authors: Mark Dukes, Robert Parviainen 
Publication date: 16 June 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/0909.3486
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- 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
Cited In (31)
- Some enumerative results related to ascent sequences
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics
- Web worlds, web-colouring matrices, and web-mixing matrices
- Partitions and partial matchings avoiding neighbor patterns
- Weak ascent sequences and related combinatorial structures
- Ascent sequences avoiding pairs of patterns
- Enumerating pattern-avoiding Fishburn permutations subject to seven statistics
- A new decomposition of ascent sequences and Euler-Stirling statistics
- An operator on ascent sequences
- Fishburn trees
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Modified ascent sequences and Bell numbers
- Difference ascent sequences
- Ascent sequences and 3-nonnesting set partitions
- On a conjecture about enumerating \((2+2)\)-free posets
- 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
- Ascent sequences avoiding a triple of 3-letter patterns and Fibonacci numbers
- Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
- Title not available (Why is that?)
- Symmetric generating functions and Euler-Stirling statistics on permutations
- $n!$ matchings, $n!$ posets
- Bi-symmetric multiple equidistributions on ascent sequences
- The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group
- Catalan pairs and Fishburn triples
- Counting general and self-dual interval orders
- Hereditary semiorders and enumeration of semiorders by dimension
- Equidistributed statistics on Fishburn matrices and permutations
- Asymptotics and statistics on Fishburn matrices and their generalizations
- Transport of patterns by Burge transpose
- Partition and composition matrices
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)
