Difference ascent sequences
From MaRDI portal
Publication:6596193
DOI10.1016/j.aam.2024.102736zbMATH Open1546.05021MaRDI QIDQ6596193
Publication date: 2 September 2024
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
matchingascent sequencerestricted growth functionnonnegative integer matrixbivincular patternfactorial posetrooted duplication treeweak ascent sequence
Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Combinatorics of partially ordered sets (06A07)
Cites Work
- Unnamed Item
- Some enumerative results related to ascent sequences
- On 1212-avoiding restricted growth functions
- Pattern avoidance in ascent sequences
- \(p,q\)-Stirling numbers and set partition statistics
- Ascent sequences and upper triangular matrices containing non-negative integers
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Weighted inversion numbers, restricted growth functions, and standard Young tableaux
- Restricted growth functions, rank row matchings of partition lattices, and q-Stirling numbers
- Enumeration of pairs of sequences by rises, falls and levels
- Restricted growth functions and incidence relations of the lattice of partitions of an n-set
- \(\sigma\)-restricted growth functions and \(p,q\)-Stirling numbers
- Restricted growth function patterns and statistics
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- On 021-avoiding ascent sequences
- A new decomposition of ascent sequences and Euler-Stirling statistics
- Alphabetic points in restricted growth functions
- Pattern-avoiding ascent sequences of length 3
- Transport of patterns by Burge transpose
- Weak ascent sequences and related combinatorial structures
- On \(\underline{12} 0\)-avoiding inversion and ascent sequences
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Refining the bijections among ascent sequences, (2+2)-free posets, integer matrices and pattern-avoiding permutations
- More restricted growth functions: Gray codes and exhaustive generation
- A note on \(p\)-ascent sequences
- Ascent sequences and the binomial convolution of Catalan numbers
- $n!$ matchings, $n!$ posets
- A direct encoding of Stoimenow's matchings as ascent sequences
- Determination of a class of Poincaré series.
- A q-Analog of Restricted Growth Functions, Dobinski's Equality, and Charlier Polynomials
- Combinatorics: The Art of Counting
- Proof of a bi-symmetric septuple equidistribution on ascent sequences
- Generalized pattern avoidance
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
- Fishburn trees
- Modified ascent sequences and Bell numbers
This page was built for publication: Difference ascent sequences
