Statistics on trapezoidal words and \(k\)-inversion sequences
From MaRDI portal
Publication:2104915
DOI10.1016/j.dam.2022.10.010zbMath1504.05013OpenAlexW4307698189MaRDI QIDQ2104915
Publication date: 8 December 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2022.10.010
Bernoulli and Euler numbers and polynomials (11B68) Permutations, words, matrices (05A05) Combinatorial probability (60C05)
Cites Work
- Unnamed Item
- The \({1/k}\)-Eulerian polynomials
- Generalized Stirling permutations, families of increasing trees and urn models
- Ehrhart series of lecture hall polytopes and Eulerian polynomials for inversion sequences
- Interpretations combinatoires des nombres de Genocchi
- The blossoming of Schröder's fourth problem
- Stirling polynomials
- The \(r\)-multipermutations
- The ascent-plateau statistics on Stirling permutations
- A proof of Lin's conjecture on inversion sequences avoiding patterns of relation triples
- Bijections for inversion sequences, ascent sequences and 3-nonnesting set partitions
- Patterns of relation triples in inversion and ascent sequences
- \(1/k\)-Eulerian polynomials and \(k\)-inversion sequences
- The \(1 / k\)-Eulerian polynomials and \(k\)-Stirling permutations
- Plane recursive trees, Stirling permutations and an urn model
- Pattern avoidance in inversion sequences
- Unimodal, log-concave and Pólya frequency sequences in combinatorics
- Real Zeros and Normal Distribution for Statistics on Stirling Permutations Defined by Gessel and Stanley
This page was built for publication: Statistics on trapezoidal words and \(k\)-inversion sequences